Sharp tractability borderlines for finding connected motifs in vertex-colored graphs

Michael R. Fellows, Guillaume Fertin, Dan Hermelin, Stéphane Vialette

Research output: Contribution to journalConference articlepeer-review

43 Scopus citations

Fingerprint

Dive into the research topics of 'Sharp tractability borderlines for finding connected motifs in vertex-colored graphs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science