Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Error and attack tolerance of complex networks

Nature · 2000 · 7.2K citations · Full text

Computing, Computer Science, Cybersecurity +14

Error and attack tolerance of complex networks

2000 · 6.5K citations

Computing, Computer Science, Cybersecurity +14

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Computing, Computer Science, Mathematics +11

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

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