Distributed coloring of graphs with an optimal number of colors

@article{Bamas2018DistributedCO,
  title={Distributed coloring of graphs with an optimal number of colors},
  author={{\'E}tienne Bamas and Louis Esperet},
  journal={ArXiv},
  year={2018},
  volume={abs/1809.08140}
}
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e.\ with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on coloring graphs of maximum degree $\Delta$ with at most $\Delta+1$ colors (or $\Delta$ colors when some simple obstructions are forbidden). When $\Delta$ is sufficiently large and $c\ge \Delta-k_\Delta+1$, for some integer $k_\Delta\approx… 

Figures from this paper

Borel combinatorics of locally finite graphs

Some basic tools and results on the existence of Borel satisfying assignments: Borel versions of greedy algorithms and augmenting procedures, local rules, Borel transversals, etc are presented.

Near-optimal distributed degree+1 coloring

A randomized distributed algorithm for D1LC that is optimal under plausible assumptions about the deterministic complexity of the problem is given, matching the best bound known for (Δ+1)-coloring.

Distributed Algorithms, the Lov\'{a}sz Local Lemma, and Descriptive Combinatorics

In this paper we consider coloring problems on graphs and other combinatorial structures on standard Borel spaces. Our goal is to obtain sufficient conditions under which such colorings can be made

References

SHOWING 1-10 OF 18 REFERENCES

The local nature of Δ-coloring and its algorithmic applications

It is shown that Δ-coloringG is reducible inO(log3n/logΔ) time to (Δ+1)-vertex coloringG in a distributed model of computation, which leads to fast distributed algorithms and a linear-processorNC algorithm for Δ- Coloring.

(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.

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.

Local Conflict Coloring

This work introduces conflict coloring as a general symmetry-breaking task that includes all the aforementioned tasks as specific instantiations - conflict coloring includes all locally checkable labeling tasks from [Naor & Stockmeyer, STOC 1993] and yields an LCA which requires a smaller number of probes than the previously best known algorithm for vertex-coloring.

Distributed Graph Coloring: Fundamentals and Recent Developments

The objective of this monograph is to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model of distributed computing and to stimulate further progress in this exciting area.

Improved Distributed Δ-Coloring

Two randomized distributed algorithms are presented that improve on an O ( log 3 n / log Δ ) -round algorithm of Panconesi and Srinivasan (STOC'93) and get (exponentially) closer to an Ω ( log log n ) round lower bound of Brandt et al. (ST OC'16).

Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth

The greedy algorithm improves the state-of-the-art Δ + 1 coloring algorithms for a large class of graphs, e.g. graphs of moderate neighborhood growth, and is the first distributed algorithm for (such) general graphs taking the chromatic number χ into account.

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 ∆.

An optimal distributed (Δ+1)-coloring algorithm?

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.

Distributed algorithms for the Lovász local lemma and graph coloring

Two new distributed algorithms for the Lovász local lemma are provided that improve on both the efficiency and simplicity of the Moser–Tardos algorithm.