On the Complexity of Distributed Splitting Problems

05/28/2019
by   Philipp Bamberger, et al.
0

One of the fundamental open problems in the area of distributed graph algorithms is the question of whether randomization is needed for efficient symmetry breaking. While there are fast, poly n-time randomized distributed algorithms for all of the classic symmetry breaking problems, for many of them, the best deterministic algorithms are almost exponentially slower. The following basic local splitting problem, which is known as the weak splitting problem takes a central role in this context: Each node of a graph G=(V,E) has to be colored red or blue such that each node of sufficiently large degree has at least one node of each color among its neighbors. Ghaffari, Kuhn, and Maus [STOC '17] showed that this seemingly simple problem is complete w.r.t. the above fundamental open question in the following sense: If there is an efficient poly n-time determinstic distributed algorithm for weak splitting, then there is such an algorithm for all locally checkable graph problems for which an efficient randomized algorithm exists. In this paper, we investigate the distributed complexity of weak splitting and some closely related problems. E.g., we obtain efficient algorithms for special cases of weak splitting, where the graph is nearly regular. In particular, we show that if δ and Δ are the minimum and maximum degrees of G and if δ=Ω( n), weak splitting can be solved deterministically in time O(Δ/δ·poly( n)). Further, if δ = Ω( n) and Δ≤ 2^εδ, there is a randomized algorithm with time complexity O(Δ/δ·poly( n)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization

We present a simple polylogarithmic-time deterministic distributed algor...
research
08/17/2022

Fast Distributed Vertex Splitting with Applications

We present polyloglog n-round randomized distributed algorithms to compu...
research
08/05/2021

Efficient CONGEST Algorithms for the Lovasz Local Lemma

We present a poly loglog n time randomized CONGEST algorithm for a natur...
research
11/03/2017

An Optimal Distributed (Δ+1)-Coloring Algorithm?

Vertex coloring is one of the classic symmetry breaking problems studied...
research
11/05/2018

Hardness of minimal symmetry breaking in distributed computing

A graph is weakly 2-colored if the nodes are labeled with colors black a...
research
02/14/2023

Distributed Symmetry Breaking on Power Graphs via Sparsification

In this paper, we present efficient distributed algorithms for classical...
research
11/02/2021

Fast Algorithms for Hop-Constrained Flows and Moving Cuts

Hop-constrained flows and their duals, moving cuts, are two fundamental ...

Please sign up or login with your details

Forgot password? Click here to reset