Shared-memory Exact Minimum Cuts

by   Monika Henzinger, et al.

The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Then we use reductions that depend on this bound, to reduce the size of the graph much faster than previously possible. We use improved data structures to further improve the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi, Ono and Ibaraki. Overall, we arrive at a system that outperforms the fastest state-of-the-art solvers for the exact minimum cut problem significantly.



page 1

page 2

page 3

page 4


The Number of Minimum k-Cuts: Improving the Karger-Stein Bound

Given an edge-weighted graph, how many minimum k-cuts can it have? This ...

Shared-Memory Branch-and-Reduce for Multiterminal Cuts

We introduce the fastest known exact algorithm for the multiterminal cut...

Fast and Deterministic Approximations for k-Cut

In an undirected graph, a k-cut is a set of edges whose removal breaks t...

Fixed-parameter tractability of counting small minimum (S,T)-cuts

The parameterized complexity of counting minimum cuts stands as a natura...

An FPT algorithm for Matching Cut

In an undirected graph, a matching cut is an edge cut which is also a ma...

Algorithm Engineering for Cut Problems

Graphs are a natural representation of data from various contexts, such ...

Faster Parallel Multiterminal Cuts

We give an improved branch-and-bound solver for the multiterminal cut pr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.