A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.1012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169825170 / rank | |||
Normal rank | |||
Revision as of 22:53, 19 March 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
