scientific article; zbMATH DE number 3906193
From MaRDI portal
Publication:3683848
[For the entire collection see Zbl 0541.00013.] The paper presents an \(O(Kn^ 4)\) algorithm for finding the K best cuts and an \(O(m^{K-1}n^ 3)\) algorithm for finding the K best cut-sets in a network with \(n+2\) nodes and m arcs.
Recommendations
Cited in
(13)- An O(K.n**4) algorithm for finding the K best cuts in a network
- A note on \(K\) best network flows
- scientific article; zbMATH DE number 3848942 (Why is no real title available?)
- On the K best integer network flows
- The maximum flow problem with disjunctive constraints
- scientific article; zbMATH DE number 4031432 (Why is no real title available?)
- Rank of Handelman hierarchy for Max-Cut
- Suboptimal cuts: their enumeration, weight and number (extended abstract)
- Mimicking Networks and Succinct Representations of Terminal Cuts
- Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- On finding the K best cuts in a network
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Methods for the one-dimensional space allocation problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683848)