P509: Enumerate all maximal chordal induced graphs in a graph

P509: Enumerate all maximal chordal induced graphs in a graph

Input:

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

Output:

All maximal chordal induced graphs in $G$.

Complexity:

$O(|E|^2|V|)$ delay.

Comment:

Exponential space. Proximity search.

Reference:

[Conte2019] (Bibtex)