On the theoretical efficiency of various network flow algorithms (Q1154258): 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.1016/0304-3975(81)90008-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085038198 / rank | |||
Normal rank | |||
Revision as of 20:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the theoretical efficiency of various network flow algorithms |
scientific article |
Statements
On the theoretical efficiency of various network flow algorithms (English)
0 references
1981
0 references
network flow algorithms
0 references
maximum flow problem
0 references
upper bounds
0 references
