P301: Enumeration of all minimal separator of a graph

P301: Enumeration of all minimal separator of a graph

Input:

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

Output:

All minimal separator of $G$.

Complexity:

$O(|V|^3)$ time per solution.

Comment:

Reference:

[Berry2000] (Bibtex)