P273: Enumeration of all interval supergraph that contains a given graph

P273: Enumeration of all interval supergraph that contains a given graph

Input:

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

Output:

All interval supergraphs each of which contain $G$.

Complexity:

$O(|V|^3)$ time for each and $O(|V|^2)$ space.

Comment:

Reference:

[Kiyomi2006a] (Bibtex)