Superfast Coloring in CONGEST via Efficient Color Sampling

  title={Superfast Coloring in CONGEST via Efficient Color Sampling},
  author={Magn'us M. Halld'orsson and Alexandre Nolin},
We present a procedure for efficiently sampling colors in the CONGEST model. It allows nodes whose number of colors exceeds their number of neighbors by a constant fraction to sample up to Θ(logn) semi-random colors unused by their neighbors in O(1) rounds, even in the distance-2 setting. This yields algorithms with O(log∗ ∆) complexity for different edge-coloring, vertex coloring, and distance-2 coloring problems, matching the best possible. In particular, we obtain an O(log∗ ∆)-round CONGEST… Expand

Tables from this paper

Ultrafast Distributed Coloring of High Degree Graphs
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
Distributed Graph Coloring Made Easy
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


Distributed (∆+1)-coloring in sublogarithmic rounds
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
(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
It is shown that a (2Δ − 1)-edge-coloring can be computed in time smaller than loge n for any e > 0, specifically, in eO([EQUATION]log log n) rounds. Expand
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced. Expand
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
A polylogarithmic-time deterministic distributed maximal independent set (MIS) algorithm for graphs with bounded neighborhood independence is obtained, hence answering Open Problem 5 of Barenboim and Elkins book. Expand
A new technique for distributed symmetry breaking
Three randomized algorithms for distributed (vertex or edge) coloring improving on previous algorithms and showing a time/color trade-off are presented, obtaining new results for several graph classes. 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
Near-Optimal, Distributed Edge Colouring via the Nibble Method
A distributed randomized algorithm for graph edge colouring based on the nibble method, a probabilistic strategy introduced by Vojtěch Rodl, makes use of a powerful large deviation inequality for functions of independent random variables. Expand
The Locality of Distributed Symmetry Breaking
New bounds on the locality of several classical symmetry breaking tasks in distributed networks are presented and a new technique for reducing symmetry breaking problems on low arboricity graphs to low degree graphs is introduced. Expand
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1992
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data. Expand
Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering
This paper presents a new algorithm for $(Delta+1)$-list coloring in the randomized ${LOCAL...} list, which simplifies the coloring oftex coloring problems in distributed computing. Expand