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.











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)