Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki, editors, Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Volume 4596 of Lecture Notes in Computer Science, pages 340-351, Springer, 2007. [doi]

This author has not been identified. It may be one of the following persons:

Michael R. Fellows

Look up 'Michael R. Fellows' in GoogleThis author has not been identified. Look up 'Guillaume Fertin' in GoogleThis author has not been identified. Look up 'Danny Hermelin' in GoogleThis author has not been identified. Look up 'Stéphane Vialette' in Google

runs on WebDSL