On treewidth and minimum fill-in of asteroidal triple-free graphs
- 10 April 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 175 (2) , 309-335
- https://doi.org/10.1016/s0304-3975(96)00206-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Triangulating graphs without asteroidal triplesDiscrete Applied Mathematics, 1996
- Treewidth and Pathwidth of Permutation GraphsSIAM Journal on Discrete Mathematics, 1995
- Treewidth of cocomparability graphs and a new order-theoretic parameterOrder, 1994
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- On Comparability and Permutation GraphsSIAM Journal on Computing, 1985
- The Complexity of the Partial Order Dimension ProblemSIAM Journal on Algebraic Discrete Methods, 1982
- Computing the Minimum Fill-In is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1981
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a GraphSIAM Journal on Computing, 1976
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970