# Faster Deterministic Distributed Coloring Through Recursive List Coloring

@article{Kuhn2020FasterDD, title={Faster Deterministic Distributed Coloring Through Recursive List Coloring}, author={F. Kuhn}, journal={ArXiv}, year={2020}, volume={abs/1907.03797} }

We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\Delta+1)$-coloring of an $n$-node graph with maximum degree $\Delta$ in $2^{O(\sqrt{\log\Delta})}\cdot\log n$ rounds. This improves on the best previously known time complexity for a large range of values of $\Delta$. For graphs with arboricity $a$, we obtain a deterministic distributed algorithm to compute a $(2+o(1))a$-coloring in time $2^{O… Expand

#### Topics from this paper

#### 16 Citations

Local Conflict Coloring Revisited: Linial for Lists

- Mathematics, Computer Science
- DISC
- 2020

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

Distributed Graph Coloring Made Easy

- Computer Science
- SPAA
- 2021

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

Distance-2 Coloring in the CONGEST Model

- Computer Science
- PODC
- 2020

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

Distributed coloring and the local structure of unit-disk graphs

- Computer Science, Mathematics
- ArXiv
- 2021

This paper considers two natural distributed settings, and conjecture that every unit-disk graph G has average degree at most 4ω(G), which would imply the existence of a O(logn) round algorithm coloring any unit- disk graph G with (approximatively) 4ω (G) colors. Expand

A distributed algorithm for vertex coloring problems in wireless networks

- Computer Science
- Array
- 2020

A General Distributed Vertex Coloring Algorithm (GDVCA) to solve four problems in wireless networks, where some (and not necessarily all) vertices assign colors to themselves and their neighbors, which is referred to them as assigning vertices. Expand

Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization

- Computer Science
- SOSA
- 2020

This paper devise an algorithm for dense graph topologies, including unit disk graphs, unit ball graphs, line graphs, graphs with bounded diversity, and many more, and is very simple as well, in sharp contrast to previous algorithms that compute such a solution within this running time. Expand

Deterministic Logarithmic Completeness in the Distributed Sleeping Model

- Computer Science
- ArXiv
- 2021

A deterministic scheme with awake complexity of O(logn) for solving any decidable problem in the distributed sleeping model by constructing a structure called Distributed Layered Tree, which turns out to be very powerful in the sleeping model, since it allows one to collect the entire graph information within a constant number of awake rounds. Expand

Simple Distributed Spanners in Dense Congest Networks

- Computer Science
- SOFSEM
- 2020

The problem of computing a sparse spanning subgraph is a well-studied problem in the distributed setting, and a lot of research was done in the direction of computing spanners or solving the more… Expand

SOFSEM 2020: Theory and Practice of Computer Science: 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020, Proceedings

- Computer Science
- SOFSEM
- 2020

The aim is to deliver a novel framework suitable for practical certification of distributed ML-powered applications in heavily regulated domains like transport, energy, healthcare, even when the certifying authority is not privy to the model training. Expand

A Decentralised Self-Healing Approach for Network Topology Maintenance

- Computer Science
- Auton. Agents Multi Agent Syst.
- 2021

Results validate the viability of the proposed self-healing solution for recovering networks from node failures, offering two variant implementations with diverse performance characteristics, which may suit different application domains. Expand

#### References

SHOWING 1-10 OF 52 REFERENCES

Distributed deterministic edge coloring using bounded neighborhood independence

- Computer Science, Mathematics
- PODC '11
- 2011

The main technical contribution is a subroutine that computes an O(Δ/p)-defective p-vertex coloring of graphs with bounded neighborhood independence in O(p2) + log* n time, for a parameter p, 1 ≤ p ≤ Δ. Expand

Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds

- Mathematics, Computer Science
- SIAM J. Comput.
- 1997

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

The Complexity of Distributed Edge Coloring with Small Palettes

- Computer Science, Mathematics
- SODA
- 2018

A randomized edge coloring algorithm that can use palette sizes as small as $\Delta + \tilde{O}(\sqrt{\Delta})$, which is a natural barrier for randomized approaches. Expand

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

- Computer Science, Mathematics
- SIAM J. Comput.
- 2019

This paper proves that exponential gaps are necessary and establish connections between the deterministic and randomized complexities in the LOCAL model, and proves that the graph shattering technique is absolutely essential to theLOCAL model. Expand

Fast Distributed Coloring Algorithms for Triangle-Free Graphs

- Mathematics, Computer Science
- ICALP
- 2013

New distributed algorithms to find (Δ/k)-coloring in graphs of girth 4 (triangle-free graphs), girth 5, and trees, where k is at most k, and o(1) is a function of Δ, are given. Expand

Distributed approximation algorithms for maximum matching in graphs and hypergraphs

- Computer Science, Mathematics
- ArXiv
- 2018

A randomized and deterministic approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in hypergraphs and an algorithm for hypergraph maximal matching, which is significantly faster than the algorithm of Ghaffari, Harris & Kuhn (2017). Expand

Distributed deterministic edge coloring using bounded neighborhood independence

- Computer Science
- PODC
- 2011

A significantly faster deterministic edge-coloring algorithm that outperforms all the existing randomized algorithms for this problem and improves it exponentially in a wide range of Δ, specifically, for 2©(log* n) ≤ Δ ≤ polylog(n). Expand

Some simple distributed algorithms for sparse networks

- Mathematics, Computer Science
- Distributed Computing
- 2001

It is shown that edge colourings with at most $2\Delta-1$ colours, and maximal matchings can be computed within deterministic rounds, where $\Delta$ is the maximum degree of the network. Expand

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model

- Mathematics, Computer Science
- DISC
- 2016

An \(\varOmega \big (\varDelta ^{\frac{1}{3}-\frac{\eta }{3}}\big )\) lower bound on the runtime of any deterministic distributed graph coloring algorithm in a weak variant of theLOCAL model is shown. Expand

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring

- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 1991

It is shown that any probabilistic algorithm for 3 coloring the ring must take at least $\frac{1}{2}\log^* n - 2$ rounds, otherwise the probability that all processors are colored legally is less than $1$. Expand