An O(K.n**4) algorithm for finding the K best cuts in a network (Q1836587): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:32, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(K.n**4) algorithm for finding the K best cuts in a network |
scientific article |
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
