P398: Enumeration of all cuts between all pair of vertices in a given graph

P398: Enumeration of all cuts between all pair of vertices in a given graph

Input:

A graph $G$.

Output:

All cuts bewteen all pair of vertices in $G$

Complexity:

Comment:

Reference:

[Martelli1976a] (Bibtex)