An O(K.n**4) algorithm for finding the K best cuts in a network (Q1836587)
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: An O(K.n**4) algorithm for finding the K best cuts in a network |
scientific article; zbMATH DE number 3797467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(K.n**4) algorithm for finding the K best cuts in a network |
scientific article; zbMATH DE number 3797467 |
Statements
An O(K.n**4) algorithm for finding the K best cuts in a network (English)
0 references
1982
0 references
finding best cuts
0 references
flow algorithms
0 references
cuts
0 references
branching technique
0 references
computational complexity
0 references
finite directed graph
0 references
