Treewidth for graphs with small chordality
Authors:
- Hans L. BodlaenderHBHans L. Bodlaender
- Dimitrios M. ThilikosDTDimitrios M. Thilikos
- 1 November 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 79 (1-3) , 45-61
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Fugitive-search games on graphs and related parametersTheoretical Computer Science, 1997
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of GraphsJournal of Algorithms, 1996
- Treewidth of Chordal Bipartite GraphsJournal of Algorithms, 1995
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- On the pathwidth of chordal graphsDiscrete Applied Mathematics, 1993
- Min cut is NP-complete for edge weighted treesTheoretical Computer Science, 1988
- 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 Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967