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

v1v2 (latest)

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

18 July 2016

Angelika Steger

ArXiv (abs)PDF HTML

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

7 / 7 papers shown

Title
Fast Distributed Brooks' Theorem Manuela Fischer Yannic Maus Magnús M. Halldórsson OOD 67 20 0 14 Nov 2022
Distributed Graph Coloring Made Easy Yannic Maus 113 26 0 12 May 2021
Local Conflict Coloring Revisited: Linial for Lists Yannic Maus Tigran Tonoyan 85 42 0 30 Jul 2020
Faster Deterministic Distributed Coloring Through Recursive List Coloring Fabian Kuhn 65 35 0 08 Jul 2019
Distributed Computing in the Asynchronous LOCAL model C. Delporte-Gallet H. Fauconnier Pierre Fraigniaud Mikael Rabie LRM 104 7 0 16 Apr 2019
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models Leonid Barenboim Michael Elkin Uri Goldenberg 100 71 0 01 Dec 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 81 104 0 20 Apr 2017