On finding the K best cuts in a network (Q792224)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finding the K best cuts in a network |
scientific article; zbMATH DE number 3852817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding the K best cuts in a network |
scientific article; zbMATH DE number 3852817 |
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
