Finding all minimal separators of a graph

This publication has 9 references indexed in Scilit:

• Efficient Algorithms for Listing Combinatorial Structures
  Published by Cambridge University Press (CUP) ,1993
• A linear time algorithm for finding tree-decompositions of small treewidth
  Published by Association for Computing Machinery (ACM) ,1993
• Treewidth and pathwidth of permutation graphs
  Published by Springer Nature ,1993
• Easy problems for tree-decomposable graphs
  Journal of Algorithms, 1991
• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• Decomposition by clique separators
  Discrete Mathematics, 1985
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• An algorithm for finding clique cut-sets
  Information Processing Letters, 1981
• Algorithms on clique separable graphs
  Discrete Mathematics, 1977