Upper and lower bounds for finding connected motifs in vertex-colored graphs

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci., 77(4):799-811, 2011. [doi]

Abstract

Abstract is missing.