A Fast Algorithm for Optimally Increasing the Edge Connectivity (Q4376163)
From MaRDI portal
scientific article; zbMATH DE number 1116352
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Algorithm for Optimally Increasing the Edge Connectivity |
scientific article; zbMATH DE number 1116352 |
Statements
A Fast Algorithm for Optimally Increasing the Edge Connectivity (English)
0 references
10 February 1998
0 references
graph algorithms
0 references
graph connectivity
0 references
network flow
0 references
minimum cuts
0 references
