How to use the minimal separators of a graph for its chordal triangulation
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 123-134
- https://doi.org/10.1007/3-540-60084-1_68
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Pathwidth and Treewidth of CographsSIAM Journal on Discrete Mathematics, 1993
- A linear time algorithm for finding tree-decompositions of small treewidthPublished by Association for Computing Machinery (ACM) ,1993
- Treewidth of circle graphsPublished by Springer Nature ,1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Interval dimension is a comparability invariantDiscrete Mathematics, 1991
- Trapezoid graphs and their coloringDiscrete Applied Mathematics, 1988
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961