P38: Enumeration of all perfect sequences in a chordal graph

P38: Enumeration of all perfect sequences in a chordal graph

Input:

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

Output:

All perfect sequences of $G$.

Complexity:

$O(1)$ time per graph with $O(|V|^2)$ space with $O(|V|^3)$ time and $O(|V|^2)$ space pre-computation.

Comment:

Reference:

[Matsui2010] (Bibtex)