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

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Computing, Computer Science, Mathematics +12

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Hans L. Bodlaender · SIAM Journal on Computing · 1996 · 1.6K citations

Computing, Computer Science, Algorithms +11

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

Computing, Computer Science, Mathematics +14

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

Computing, Computer Science, Mathematics +15

Color-coding

Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM · 1995 · 1K citations · Full text

Computing, Computer Science, Algorithms +16