GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
Anne Berry, Jean-Paul Bordat, Olivier Cogis · International Journal of Foundations of Computer Science · 2000
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n3) time per separator, thus gaining a factor of n2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from the work of Kloks and Kratsch on listing all the minimal separators of a graph.