A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:23, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new?old algorithm for minimum-cut and maximum-flow in closure graphs |
scientific article |
Statements
A new?old algorithm for minimum-cut and maximum-flow in closure graphs (English)
0 references
30 July 2002
0 references
closure graph
0 references
maximum flow
0 references
minimum-cut
0 references
sensitivity analysis
0 references
Lerchs-Grossmann algorithm
0 references
