Computing treewidth and minimum fill-in: All you need are the minimal separators

This publication has 16 references indexed in Scilit:

• A linear time algorithm for finding tree-decompositions of small treewidth
  Published by Association for Computing Machinery (ACM) ,1993
• Treewidth of chordal bipartite graphs
  Published by Springer Nature ,1993
• The pathwidth and treewidth of cographs
  Published by Springer Nature ,1990
• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Distance-hereditary graphs
  Journal of Combinatorial Theory, Series B, 1986
• The NP-completeness column: an ongoing guide
  Journal of Algorithms, 1985
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• Comparability graphs and intersection graphs
  Discrete Mathematics, 1983
• On rigid circuit graphs
  Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961