Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

First Page		Document Content
Date: 2011-04-27 05:26:37 Graph theory Mathematics NP-complete problems Graph coloring Matching Bipartite graph Color-coding Treewidth Graph Cycle Line graph Chromatic polynomial		Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Download Document from Source Website File Size: 241,52 KB Share Document on Facebook

	2016-mst2D color coding-base2 DocID: 1rdOX - View Document
	Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office DocID: 1r8ab - View Document
	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer DocID: 1qX1s - View Document
	/home/hansen/doc/papers/coledge/fig/fig013.eps DocID: 1pJju - View Document
	LNBIReaction Motifs in Metabolic Networks DocID: 1pkYd - View Document