A partial k-arboretum of graphs with bounded treewidth
- 1 December 1998
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 209 (1-2) , 1-45
- https://doi.org/10.1016/s0304-3975(97)00228-4
Abstract
No abstract availableKeywords
This publication has 62 references indexed in Scilit:
- Triangulating graphs without asteroidal triplesDiscrete Applied Mathematics, 1996
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- Minimal acyclic forbidden minors for the family of graphs with bounded path-widthDiscrete Mathematics, 1994
- On Linear Time Minor Tests with Depth-First SearchJournal of Algorithms, 1993
- A lower bound on the area of permutation layoutsAlgorithmica, 1991
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- A separator theorem for graphs of bounded genusJournal of Algorithms, 1984