Approximating treewidth and pathwidth of some classes of perfect graphs
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 116-125
- https://doi.org/10.1007/3-540-56279-6_64
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Better algorithms for the pathwidth and treewidth of graphsPublished by Springer Nature ,1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- On domination problems for permutation and other graphsTheoretical Computer Science, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961