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 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(82)90037-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018639409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3683848 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4058442 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:06, 13 June 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
