The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56092053, #quickstatements; #temporary_batch_1706287054262 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:21, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate |
scientific article |
Statements
The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (English)
0 references
28 February 1997
0 references
