Suboptimal cuts: Their enumeration, weight and number
From MaRDI portal
Publication:5204331
DOI10.1007/3-540-55719-9_88zbMath1427.68254MaRDI QIDQ5204331
Mihalis Yannakakis, Vijay V. Vazirani
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_88
68R10: Graph theory (including graph drawing) in computer science
05C30: Enumeration in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs, Most balanced minimum cuts, Efficient Algorithms for the k Smallest Cuts Enumeration