Universally-Optimal Distributed Exact Min-Cut

05/30/2022
by   Mohsen Ghaffari, et al.
0

We present a universally-optimal distributed algorithm for the exact weighted min-cut. The algorithm is guaranteed to complete in O(D + √(n)) rounds on every graph, recovering the recent result of Dory, Efron, Mukhopadhyay, and Nanongkai [STOC'21], but runs much faster on structured graphs. Specifically, the algorithm completes in O(D) rounds on (weighted) planar graphs or, more generally, any (weighted) excluded-minor family. We obtain this result by designing an aggregation-based algorithm: each node receives only an aggregate of the messages sent to it. While somewhat restrictive, recent work shows any such black-box algorithm can be simulated on any minor of the communication network. Furthermore, we observe this also allows for the addition of (a small number of) arbitrarily-connected virtual nodes to the network. We leverage these capabilities to design a min-cut algorithm that is significantly simpler compared to prior distributed work. We hope this paper showcases how working within this paradigm yields simple-to-design and ultra-efficient distributed algorithms for global problems. Our main technical contribution is a distributed algorithm that, given any tree T, computes the minimum cut that 2-respects T (i.e., cuts at most 2 edges of T) in universally near-optimal time. Moreover, our algorithm gives a deterministic O(D)-round 2-respecting cut solution for excluded-minor families and a deterministic O(D + √(n))-round solution for general graphs, the latter resolving a question of Dory, et al. [STOC'21]

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2018

Round- and Message-Optimal Distributed Part-Wise Aggregation

Distributed graph algorithms that separately optimize for either the num...
research
02/28/2020

Improved Algorithm for Min-Cuts in Distributed Networks

In this thesis, we present fast deterministic algorithm to find small cu...
research
04/20/2020

Distributed Weighted Min-Cut in Nearly-Optimal Time

Minimum-weight cut (min-cut) is a basic measure of a network's connectiv...
research
01/18/2018

Minor Excluded Network Families Admit Fast Distributed Algorithms

Distributed network optimization algorithms, such as minimum spanning tr...
research
11/25/2017

Optimal Gossip Algorithms for Exact and Approximate Quantile Computations

This paper gives drastically faster gossip algorithms to compute exact a...
research
08/07/2020

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

We prove that any n-node graph G with diameter D admits shortcuts with c...
research
03/05/2023

Exact Distributed Sampling

Fast distributed algorithms that output a feasible solution for constrai...

Please sign up or login with your details

Forgot password? Click here to reset