We present an efficient algorithm which computes the set of minimal separators of a graph in O(n
3) time per separator, thus gaining a factor of n
2 on the current best-time algorithms for this problem. Our process is based on a newst ructural result, derived from the work
of Kloks and Kratsch on listing all the minimal separators of a graph.
Keywords Graph - Minimal Separator - Enumeration Algorithm