P129: Enumeration of all minimal strongly connected subgraphs in a strongly connected subgraph

P129: Enumeration of all minimal strongly connected subgraphs in a strongly connected subgraph

Input:

A strongly connected subgraph $G$.

Output:

All minimal strongly connected subgraph.

Complexity:

Incremental polynomial time.

Comment:

Reference:

[Boros2004b] (Bibtex)