Fingerprint
Dive into the research topics of 'Sharp tractability borderlines for finding connected motifs in vertex-colored graphs'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
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 journal › Conference article › peer-review
43
Scopus
citations