Computing All Small Cuts in an Undirected Network (Q4377436)
From MaRDI portal
scientific article; zbMATH DE number 1116174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing All Small Cuts in an Undirected Network |
scientific article; zbMATH DE number 1116174 |
Statements
Computing All Small Cuts in an Undirected Network (English)
0 references
9 February 1998
0 references
minimum cuts
0 references
graphs
0 references
edge-splitting
0 references
polynomial algorithm
0 references
