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

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]

Abstract

Abstract is missing.