On finding the K best cuts in a network (Q792224): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1059093 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: M. A. Frumkin / rank | |||
Normal rank | |||
Revision as of 04:22, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding the K best cuts in a network |
scientific article |
Statements
On finding the K best cuts in a network (English)
0 references
1984
0 references
A counterexample to an algorithm of the first author [ibid. 1, 186-189 (1982; Zbl 0505.90023)] for finding K best cuts in a network is given.
0 references
best cuts
0 references
flow algorithm
0 references
ranking of solutions
0 references
counterexample
0 references
