P296: Enumeration of all minimal separator of a chordal graph

P296: Enumeration of all minimal separator of a chordal graph

Input:

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

Output:

All minimal separator of $G$.

Complexity:

$O(|V|+|E|)$ total time.

Comment:

Reference:

[Chandran2001] (Bibtex)