Strong-Diameter Network Decomposition

02/19/2021
by   Yi-Jun Chang, et al.
0

Network decomposition is a central concept in the study of distributed graph algorithms. We present the first polylogarithmic-round deterministic distributed algorithm with small messages that constructs a strong-diameter network decomposition with polylogarithmic parameters. Concretely, a (C, D) strong-diameter network decomposition is a partitioning of the nodes of the graph into disjoint clusters, colored with C colors, such that neighboring clusters have different colors and the subgraph induced by each cluster has a diameter at most D. In the weak-diameter variant, the requirement is relaxed by measuring the diameter of each cluster in the original graph, instead of the subgraph induced by the cluster. A recent breakthrough of Rozhoň and Ghaffari [STOC 2020] presented the first poly(log n)-round deterministic algorithm for constructing a weak-diameter network decomposition where C and D are both in poly(log n). Their algorithm uses small O(log n)-bit messages. One can transform their algorithm to a strong-diameter network decomposition algorithm with similar parameters. However, that comes at the expense of requiring unbounded messages. The key remaining qualitative question in the study of network decompositions was whether one can achieve a similar result for strong-diameter network decompositions using small messages. We resolve this question by presenting a novel technique that can transform any black-box weak-diameter network decomposition algorithm to a strong-diameter one, using small messages and with only moderate loss in the parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2019

On Strong Diameter Padded Decompositions

Given a weighted graph G=(V,E,w), a partition of V is Δ-bounded if the d...
research
09/23/2022

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization

This paper presents significantly improved deterministic algorithms for ...
research
07/16/2020

Improved Deterministic Network Decomposition

Network decomposition is a central tool in distributed graph algorithms....
research
08/09/2019

Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond

Network decompositions, as introduced by Awerbuch, Luby, Goldberg, and P...
research
10/21/2022

A Simple Deterministic Distributed Low-Diameter Clustering

We give a simple, local process for nodes in an undirected graph to form...
research
09/19/2019

Low Diameter Graph Decompositions by Approximate Distance Computation

In many models for large-scale computation, decomposition of the problem...
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...

Please sign up or login with your details

Forgot password? Click here to reset