P275: Enumeration of all minimal separators of a 3-connected planar graph

P275: Enumeration of all minimal separators of a 3-connected planar graph

Input:

A 3-connected planar graph $G = (V, E)$.

Output:

All minimal separators of $G$.

Complexity:

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

Comment:

Reference:

[Mazoit2006] (Bibtex)