P315: Enumeration of all minimal separators of a graph

P315: Enumeration of all minimal separators of a graph

Input:

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

Output:

All minimal separators of $G$.

Complexity:

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

Comment:

$R$ is the number of solutions.

Reference:

[Kloks1998] (Bibtex)