Improved Deterministic Network Decomposition

@inproceedings{Ghaffari2021ImprovedDN,
  title={Improved Deterministic Network Decomposition},
  author={Mohsen Ghaffari and Christoph Grunau and V{\'a}clav Rozhoň},
  booktitle={SODA},
  year={2021}
}
Network decomposition is a central tool in distributed graph algorithms. We present two improvements on the state of the art for network decomposition, which thus lead to improvements in the (deterministic and randomized) complexity of several well-studied graph problems. - We provide a deterministic distributed network decomposition algorithm with $O(\log^5 n)$ round complexity, using $O(\log n)$-bit messages. This improves on the $O(\log^7 n)$-round algorithm of Rozhoň and Ghaffari [STOC'20… Expand
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
We present a simple deterministic distributed algorithm that computes a $(\Delta+1)$-vertex coloring in $O(\log^2 \Delta \cdot \log n)$ rounds, in any graph with at most $n$ nodes and maximum degreeExpand
Dynamic Distributed MIS with Improved Bounds
TLDR
A deterministic distributed algorithm is presented that achieves an amortized message complexity of $\tilde{O}(m^{2/3})$ and anAmortized round complexity of $O(1)$ under fully dynamic edge updates in the CONGEST model, where $tilde {O}(\cdot)$ suppresses polylogarithmic factors. Expand
Distributed Graph Coloring Made Easy
TLDR
A deterministic CONGEST algorithm to compute an O(kΔ)-vertex coloring in O( Δ/k)+łog^* n rounds, where Δ is the maximum degree of the network graph and 1łeq kłeq O(Δ) can be freely chosen. Expand
Ultrafast Distributed Coloring of High Degree Graphs
TLDR
A new randomized distributed algorithm that can color all n-node graphs of maximum degree ∆ ≥ log n in O(log∗ n) rounds and shows that the randomized complexity of ∆ + 1-list coloring in Congest depends inherently on the deterministic complexity of related coloring problems. Expand
Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs
TLDR
This work addresses the question of whether one can achieve a simple, elementary O(α)-approximation algorithm not based on any LP-based methods, either in the centralized setting or in the distributed setting, and provides a surprisingly simple combinatorial algorithm that is asymptotically optimal in terms of both approximation factor and running time. Expand
Efficient CONGEST Algorithms for the Lovasz Local Lemma
TLDR
A poly log log n time randomized CONGEST algorithm for a natural class of Lovász Local Lemma (LLL) instances on constant degree graphs implies that there are no LCL problems with randomized complexity between log n and poly loglog n. Expand
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
TLDR
This work proves lower bounds for a much more relaxed family of distributed symmetry breaking problems and provides a novel way to do simplifications for round elimination, which is expected to be of independent interest. Expand
The Randomized Local Computation Complexity of the Lovász Local Lemma
TLDR
This paper shows that the randomized LCA complexity of the Lovász Local Lemma (LLL) on constant degree graphs is Θ(log n), and shows that for every fixed constant c ≥ 2, the deterministic VOLUME complexity of c-coloring a bounded degree tree isΘ(n), where the VOLUME model is a close relative of the LCA model. Expand
Superfast Coloring in CONGEST via Efficient Color Sampling
TLDR
An O(log∗ ∆)-round CONGEST algorithm for (2∆− 1)-edge coloring when ∆ ≥ log n, and poly(log logn)-round algorithm in general is obtained. Expand
Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics
TLDR
It is known that randomness does not help with solving local problems on oriented paths and there are four classes of local problems and most classes have natural definitions in all three fields. Expand
...
1
2
...

References

SHOWING 1-10 OF 25 REFERENCES
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond
TLDR
This work presents an improved deterministic distributed algorithm for constructing network decompositions of power graphs using small messages, which improves upon the algorithm of Ghaffari and Kuhn [DISC'18], and provides a randomized distributed network decomposition algorithm, based on this algorithm, with failure probability exponentially small in the input size. Expand
Network decomposition and locality in distributed computation
The authors introduce a concept of network decomposition, a partitioning of an arbitrary graph into small-diameter connected components, such that the graph created by contracting each component intoExpand
An Improved Distributed Algorithm for Maximal Independent Set
TLDR
A very simple randomized algorithm providing a near-optimal local complexity of O(log deg(v) + log 1/e) rounds, with probability at least 1, which incidentally, when combined with some known techniques, also leads to a near -optimal global complexity. Expand
On Derandomizing Local Distributed Algorithms
TLDR
This paper combines the method of conditional expectation with network decompositions to obtain a generic and clean recipe for derandomizing LOCAL algorithms, which leads to significant improvements on a number of problems, in cases resolving known open problems. Expand
On the complexity of local distributed graph problems
TLDR
The result can be viewed as showing that the only obstacle to getting efficient determinstic algorithms in the LOCAL model is an efficient algorithm to approximately round fractional values into integer values. Expand
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
TLDR
This paper provides tools for derandomizing solutions to local problems, when the n nodes can only send O(\log n)-bit messages in each round of communication, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Expand
Polylogarithmic-time deterministic network decomposition and distributed derandomization
TLDR
A simple polylogarithmic-time deterministic distributed algorithm for network decomposition that improves on a celebrated 2 O(√logn)-time algorithm and settles a central and long-standing question in distributed graph algorithms. Expand
Improved distributed algorithms for coloring and network decomposition problems
TLDR
It is shown that A-coloring G is reducible in 0(log3 n/log A) time to (A+ I)-vertex coloring G in a distributed model, which leads to fast distributed algorithms, and a linear–processor NC algorithm, for Acoloring. Expand
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
TLDR
New randomized algorithms that improve the complexity of the classic (Δ+1)-coloring problem, and its generalization (� Δ+1-list-coloring, in three well-studied models of distributed, parallel, and centralized computation: Distributed Congested Clique, Centralized Local Computation and Massively Parallel Computation. Expand
An optimal distributed (Δ+1)-coloring algorithm?
TLDR
This paper presents a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log∗n + Detd(poly logn)) time, where Det d(n′) is the deterministic complexity of (deg+1-list coloring) on n′-vertex graphs. Expand
...
1
2
3
...