Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
ICALP, 2007.

ICALP 2007
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-2007-FellowsFHV,
	author        = "Michael R. Fellows and Guillaume Fertin and Danny Hermelin and Stéphane Vialette",
	booktitle     = "{Proceedings of the 34th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/978-3-540-73420-8_31",
	isbn          = "978-3-540-73419-2",
	pages         = "340--351",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs}",
	volume        = 4596,
	year          = 2007,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.