Algorithmica[removed]: 209–223 Algorithmica

First Page		Document Content
Date: 2011-01-06 05:42:27 Degeneracy Adjacency matrix Graph Planar graphs Degree Hamiltonian path Tree Color-coding Connectivity Graph theory Mathematics NP-complete problems		Algorithmica[removed]: 209–223 Algorithmica Add to Reading List Source URL: perso.ens-lyon.fr Download Document from Source Website File Size: 165,15 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