P253: Enumeration of all maximal induced subgraphs for (connected) hereditary graph properties

P253: Enumeration of all maximal induced subgraphs for (connected) hereditary graph properties

Input:

A graph $G$.

Output:

All maximal induced subgraphs in $\mathcal{P}(G)$.

Complexity:

See the paper.

Comment:

$\mathcal{P}$ is a set of subgraphs of $G$ with (connected) hereditary graph properties.

Reference:

[Cohen2008] (Bibtex)