Safe separators for treewidth

This publication has 21 references indexed in Scilit:

• PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS*
  Computational Intelligence, 2005
• Algorithms for Radio Link Frequency Assignment: The Calma Project
  Operations Research, 2002
• A practical algorithm for making filled graphs minimal
  Theoretical Computer Science, 2001
• A partial k-arboretum of graphs with bounded treewidth
  Theoretical Computer Science, 1998
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
  SIAM Journal on Computing, 1996
• Monadic second-order evaluations on tree-decomposable graphs
  Theoretical Computer Science, 1993
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
  Algorithmica, 1992
• Easy problems for tree-decomposable graphs
  Journal of Algorithms, 1991
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Characterization and Recognition of Partial 3-Trees
  SIAM Journal on Algebraic Discrete Methods, 1986