P213: Enumeration of all chordal sandwiches in a graph

P213: Enumeration of all chordal sandwiches in a graph

Input:

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

Output:

All chordal sandwiches in $G$.

Complexity:

Polynomial delay with polynomial space.

Comment:

Reference:

[Kijima2010] (Bibtex)