A Partial k-Arboretum of Graphs with Bounded Treewidth

@article{Bodlaender1998APK,
  title={A Partial k-Arboretum of Graphs with Bounded Treewidth},
  author={Hans L. Bodlaender},
  journal={Theor. Comput. Sci.},
  year={1998},
  volume={209},
  pages={1-45}
}
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes are discussed. 
Highly Influential
This paper has highly influenced 47 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 529 extracted citations

AI*IA 2018 – Advances in Artificial Intelligence

Lecture Notes in Computer Science • 2018
View 18 Excerpts
Highly Influenced

A Characterization of the degree sequences of 2-trees

Journal of Graph Theory • 2008
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 64 references

Recursively Constructed Graph Families

R. B. Borie
PhD thesis, School of Information and Computer Science, Georgia Institute of Technology • 1988
View 6 Excerpts
Highly Influenced

Pathwidth

H. Kaplan, R. Shamir
bandwidth and completion problems to proper interval graphs with small cliques, Technical Report 285/93, Inst. for Computer Science, Tel Aviv University, Tel Aviv, Israel • 1993
View 7 Excerpts
Highly Influenced

Graph searching

D. Bienstock
path-width, tree-width and related problems (a survey), DIMACS Ser. in Discrete Mathematics and The- oretical Computer Science, 5 • 1991
View 7 Excerpts
Highly Influenced

Graph algorithms, in Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, Amster- dam

J. van Leeuwen
1990
View 7 Excerpts
Highly Influenced

Decomposition of graphs | a uni- form approach for the design of fast sequential and parallel algorithms on graphs

W. Hohberg, R. Reischuk
Draft paper • 1989
View 5 Excerpts
Highly Influenced

Die Baumweite von Graphen als ein Ma f ur die Kom- pliziertheit algorithmischer Probleme

P. Scheffler
PhD thesis, Akademie der Wis- senschaften der DDR, Berlin • 1989
View 9 Excerpts
Highly Influenced

Graph searching and a minimax theorem for tree-width

P. D. Seymour, R. Thomas
Technical Report 89-1, DIMACS • 1989
View 13 Excerpts
Highly Influenced

Linear Algorithms on k-Terminal Graphs

T. V. Wimer
PhD thesis, Dept. of Computer Science, Clemson University • 1987
View 4 Excerpts
Highly Influenced

Nonconstructive Advances in Polynomial-Time Complexity

Inf. Process. Lett. • 1987
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…