P131: Enumeration of all minimal 2-vertex connected spanning subgraphs in a graph

P131: Enumeration of all minimal 2-vertex connected spanning subgraphs in a graph

Input:

A graph $G$.

Output:

All minimal 2-vertex connected spanning subgraphs of $G$.

Complexity:

Incremental polynomial time.

Comment:

Reference:

[Khachiyan2006a] (Bibtex)