A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.1012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.1012 / rank | |||
Normal rank | |||
Latest revision as of 21:31, 19 December 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
0 references
0 references
0 references
0 references
