Get started
Keyword

treewidth

Description: Treewidth is an integer graph invariant that measures how closely an undirected graph resembles a tree and supports the analysis of graph algorithms.
Wikidata ID: wiki/Q5067368
OpenAlex ID: keywords/treewidth
Parameterized Algorithms
2015 · Marek Cygan, Fedor V. Fomin, et al. · Springer eBooks · 2,042
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
1996 · Hans L. Bodlaender · SIAM Journal on Computing · 1,544
Graph minors. II. Algorithmic aspects of tree-width
1986 · Neil Robertson, P.D Seymour · Journal of Algorithms · 1,542
Complexity of Finding Embeddings in a k -Tree
1987 · Stefan Arnborg, Derek G. Corneil, et al. · SIAM Journal on Algebraic and Discrete Methods · 1,206
A partial k-arboretum of graphs with bounded treewidth
1998 · Hans L. Bodlaender · Theoretical Computer Science · 1,106
Color-coding
1995 · Noga Alon, Raphael Yuster, et al. · Journal of the ACM · 1,002
PDF
Graphs on Surfaces
2001 · Bojan Mohar, Carsten Thomassen · Medical Entomology and Zoology · 831
Graph minors. III. Planar tree-width
1984 · Neil Robertson, P.D Seymour · Journal of Combinatorial Theory Series B · 719
Graph minors. X. Obstructions to tree-decomposition
1991 · Neil Robertson, P.D Seymour · Journal of Combinatorial Theory Series B · 658
Upper bounds to the clique width of graphs
2000 · Bruno Courcelle, Stephan Olariu · Discrete Applied Mathematics · 619
PDF
Linear time algorithms for NP-hard problems restricted to partial k-trees
1989 · Stefan Arnborg, Andrzej Proskurowski · Discrete Applied Mathematics · 577
On problems without polynomial kernels
2009 · Hans L. Bodlaender, Rodney G. Downey, et al. · Journal of Computer and System Sciences · 567
PDF
Treewidth: Computations and Approximations
1994 · Ton Kloks · 547
Simulating Quantum Computation by Contracting Tensor Networks
2008 · Igor L. Markov, Yaoyun Shi · SIAM Journal on Computing · 471
PDF
Quickly Excluding a Planar Graph
1994 · N. Robertson, P. Seymour, et al. · Journal of Combinatorial Theory Series B · 447
The complexity of homomorphism and constraint satisfaction problems seen from the other side
2007 · Martin Grohe · Journal of the ACM · 424
Call routing and the ratcatcher
1994 · P. D. Seymour, R. Thomas · COMBINATORICA · 394
Graph Searching and a Min-Max Theorem for Tree-Width
1993 · P.D. Seymour, R. Thomas · Journal of Combinatorial Theory Series B · 387
Treewidth
1994 · Springer eBooks · 382
On the Altitude of Nodes in Random Trees
1978 · A. Meir, J. W. Moon · Canadian Journal of Mathematics · 360
PDF
A tourist guide through Treewidth
1992 · Hans L. Bodlaender · 339
Decomposable negation normal form
2001 · Adnan Darwiche · Journal of the ACM · 337
Subgraph Isomorphism in Planar Graphs and Related Problems
1999 · David Eppstein · Journal of Graph Algorithms and Applications · 329
Dynamic programming on graphs with bounded treewidth
1988 · Hans L. Bodlaender · Lecture notes in computer science · 329
PDF
Diameter and Treewidth in Minor-Closed Graph Families
2000 · D. Eppstein · Algorithmica · 313
PDF
Works count: 5,218
Citation count: 71,600
Year
Topic
Type