P181: Enumeration of all minimal separators in a graph

P181: Enumeration of all minimal separators in a graph

Input:

A graph $G = (V, E)$.

Output:

All minimal separators in $G$.

Complexity:

$O(|V|^6R)$ total time.

Comment:

$R$ is the number of solutions.

Reference:

[Kloks1994] (Bibtex)