scientific article; zbMATH DE number 6472607
From MaRDI portal
Publication:5501810
zbMath1321.05254MaRDI QIDQ5501810
Chandra Chekuri, Matthew S. Levine, Andrew V. Goldberg, Clifford Stein, David R. Karger
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Minimum degree orderings ⋮ Efficient algorithms for the problems of enumerating cuts by non-decreasing weights ⋮ Structural properties of the minimum cut of partially-supplied graphs ⋮ Efficient Algorithms for the k Smallest Cuts Enumeration ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ Practical Minimum Cut Algorithms ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations ⋮ Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ An efficient network flow code for finding all minimum cost \(s-t\) cutsets ⋮ Minimum Cuts of Simple Graphs in Almost Always Linear Time
This page was built for publication:
