Publication:5501810
From MaRDI portal
zbMath1321.05254MaRDI QIDQ5501810
Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Clifford Stein, Matthew S. Levine
Publication date: 14 August 2015
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
An efficient network flow code for finding all minimum cost \(s-t\) cutsets, Graph connectivity and its augmentation: Applications of MA orderings, Minimum degree orderings, Efficient algorithms for the problems of enumerating cuts by non-decreasing weights, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations, Computing finest mincut partitions of a graph and application to routing problems, Efficient Algorithms for the k Smallest Cuts Enumeration, Minimum Cuts of Simple Graphs in Almost Always Linear Time