Efficient Deterministic Distributed Coloring with Small Bandwidth

@article{Bamberger2020EfficientDD,
  title={Efficient Deterministic Distributed Coloring with Small Bandwidth},
  author={Philipp Bamberger and Fabian Kuhn and Yannic Maus},
  journal={Proceedings of the 39th Symposium on Principles of Distributed Computing},
  year={2020}
}
We show that the (degree + 1)-list coloring problem can be solved deterministically in O(D · log n · log2 Δ) rounds in the CONGEST model, where D is the diameter of the graph, n the number of nodes, and Δ the maximum degree. Using the recent polylogarithmic-time deterministic network decomposition algorithm by Rozhoň and Ghaffari [49], this implies the first efficient (i.e., poly log n-time) deterministic CONGEST algorithm for the (Δ + 1)-coloring and the (degree + 1)-list coloring problem… Expand
Distance-2 Coloring in the CONGEST Model
TLDR
If Δ is the maximum degree of G, it is shown that there is a randomized CONGEST model algorithm to compute a distance-2 coloring of G with Δ2 + 1 colors in O(log Δ · log n) rounds. Expand
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
TLDR
This work presents the first deterministic (Δ + 1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(log Δ + log log n) rounds, and shows an extension of the algorithm to the MPC regime in which machines have sublinear space. Expand
Improved Deterministic Network Decomposition
TLDR
A modified version of the CONGEST network decomposition algorithm is presented, constructing a decomposition whose quality does not depend on the identifiers, and thus improves the randomized round complexity for various problems. Expand
Distributed Testing of Distance-k Colorings
TLDR
It is shown that for one natural farness measure, significantly better algorithms are possible for testing distance-3 coloring than for testingdistance-k coloring for \(k \ge 4\), and it is also shown that several farness criteria for measuring the distance to a valid coloring are considered. Expand
Local Conflict Coloring Revisited: Linial for Lists
TLDR
The state-of-the-art truly local $(deg+1)$-list coloring algorithm from Barenboim et al. [PODC'18] is improved by slightly reducing the runtime to $O(\sqrt{\Delta\log\Delta})+\log^* n$ and significantly reducing the message size (from huge to roughly $\Delta$). Expand
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
TLDR
A new graph sparsification technique is introduced that deterministically computes a low-degree subgraph with additional desired properties that helps solve the fundamental problems of Maximal Matching and Maximal Independent Set with O(nε) space on each machine for any constant ε > 0. Expand
Network Decomposition and Distributed Derandomization (Invited Paper)
TLDR
A recent line of work is overviewed, which proved that any (locally-checkable) graph problem that admits an efficient randomized distributed algorithm also admits a efficient deterministic distributed algorithm, thereby resolving several central and decades-old open problems in distributed graph algorithms. Expand
Structural Information and Communication Complexity: 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings
We overview a recent line of work [Rozhoň and Ghaffari at STOC 2020; Ghaffari, Harris, and Kuhn at FOCS 2018; and Ghaffari, Kuhn, and Maus at STOC 2017], which proved that any (locallycheckable)Expand
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
TLDR
The Chang-Li-Pettie algorithm runs in T_local =poly(loglog n) rounds, which sets the state-of-the-art randomized round complexity for the problem in the local model, and employs a combination of tools, notably pseudorandom generators (PRG) and bounded-independence hash functions. Expand
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
  • M. Charikar, Weiyun Ma, Li-Yang Tan
  • Computer Science
  • PODC
  • 2021
TLDR
The Connectivity algorithm is an instantiation of a general method for converting randomized algorithms in the PRAM model to highly randomness-efficient MPC algorithms and achieves a super-polynomial saving in randomness complexity. Expand
...
1
2
...

References

SHOWING 1-10 OF 76 REFERENCES
(Δ+1) Coloring in the Congested Clique Model
TLDR
Improved algorithms for the (∆ + 1) (vertex) coloring problem in the Congested Clique model of distributed computing and a deterministic algorithm that works in O(log ∆) rounds is presented. 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
Weak graph colorings: distributed algorithms and applications
  • F. Kuhn
  • Mathematics, Computer Science
  • SPAA '09
  • 2009
TLDR
A faster deterministic algorithm for the standard vertex coloring problem on graphs with moderate degrees is obtained, it is shown that in time O(Δ+log*n), a (Γ+1)-coloring can be computed, a task for which the best previous algorithm required time O (Δ*log(Γ) + log*n). Expand
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
TLDR
This work presents the first deterministic (Δ + 1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(log Δ + log log n) rounds, and shows an extension of the algorithm to the MPC regime in which machines have sublinear space. Expand
Distributed coloring in O~(⎷(log n)) bit rounds
TLDR
For the cycle in which all edges have the same orientation, it is shown that a simple randomized algorithm can achieve a 3-coloring with only O(√log n) rounds of bit transmissions, with high probability, and the bit complexity of coloring an oriented cycle is Ω( ∼log n), with high likelihood, no matter how many colors are allowed. 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
Sublinear Algorithms for (Δ+ 1) Vertex Coloring
TLDR
A remarkably simple meta-algorithm for the (∆ + 1) coloring problem: Sample O(log n) colors for each vertex independently and uniformly at random from the ∆+ 1 colors; find a proper coloring of the graph using only the sampled colors of each vertex. Expand
Improved Distributed Delta-Coloring
We present a randomized distributed algorithm that computes a Δ- coloring in any non-complete graph with maximum degree Δ ≥ 4 in O(log Δ) +2O( √ log log n) rounds, as well as a randomized algorithmExpand
On the Complexity of Distributed Network Decomposition
In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (n?(n),n?(n))-decomposition innO(?(n))time, whereformula. AsExpand
Distributed (∆+1)-coloring in sublogarithmic rounds
TLDR
A new randomized coloring algorithm for (∆+1)-coloring running in O(√log ∆)+ 2^O( ∼log log n) rounds with probability 1-1/n^Ω(1) in a graph with n nodes and maximum degree ∆. Expand
...
1
2
3
4
5
...