Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

First Page		Document Content
Date: 2013-01-07 10:28:15 Graph coloring NP-complete problems Bipartite graph Parity Graph theory Treewidth Vertex cover Cubic graph Cograph Hadwiger number		Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Download Document from Source Website File Size: 420,34 KB Share Document on Facebook

	Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh) DocID: 1uVYI - View Document
	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Dániel Marx Humboldt-Universität zu Berlin Joint work with DocID: 1uB4t - View Document
	Structural complexity of CSPs: the role of treewidth and its generalizations ´ Daniel Marx Tel Aviv University, Israel DocID: 1ubqB - View Document
	To Approximate Treewidth, Use Treelength! David Coudert, Guillaume Ducoffe, Nicolas Nisse To cite this version: David Coudert, Guillaume Ducoffe, Nicolas Nisse. To Approximate Treewidth, Use Treelength!. Siam Journal on DocID: 1tq3n - View Document
	On Exact Algorithms for Treewidth HANS L. BODLAENDER, Utrecht University, the Netherlands FEDOR V. FOMIN, University of Bergen, Norway ARIE M. C. A. KOSTER, Aachen University, Germany DIETER KRATSCH, Universit´e de Metz DocID: 1t6K1 - View Document