P512: Enumerate all maximal connected acyclic directed subgraphs in a graph

P512: Enumerate all maximal connected acyclic directed subgraphs in a graph

Input:

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

Output:

All maximal connected acyclic directed subgraphs in $G$.

Complexity:

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

Comment:

Exponential space. Proximity search.

Reference:

[Conte2019] (Bibtex)