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

International Symposium on Distributed Computing (DISC), 2016

18 July 2016

Angelika Steger

ArXiv (abs)PDF HTML

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

9 / 9 papers shown

Title
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual GraphsInternational Symposium on Distributed Computing (DISC), 2024 Maxime Flin Magnús M. Halldórsson Alexandre Nolin 130 2 0 20 Aug 2024
Fast Distributed Brooks' TheoremACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 Manuela Fischer Yannic Maus Magnús M. Halldórsson OOD 103 21 0 14 Nov 2022
Distributed Graph Coloring Made EasyACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021 Yannic Maus 190 26 0 12 May 2021
Local Conflict Coloring Revisited: Linial for ListsInternational Symposium on Distributed Computing (DISC), 2020 Yannic Maus Tigran Tonoyan 172 44 0 30 Jul 2020
Faster Deterministic Distributed Coloring Through Recursive List ColoringACM-SIAM Symposium on Discrete Algorithms (SODA), 2019 Fabian Kuhn 109 37 0 08 Jul 2019
Distributed Computing in the Asynchronous LOCAL model C. Delporte-Gallet H. Fauconnier Pierre Fraigniaud Mikael Rabie LRM 140 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 140 73 0 01 Dec 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 109 107 0 20 Apr 2017
Distributed $(Δ+1)$ -Coloring in Sublogarithmic Rounds David G. Harris Johannes Schneider Hsin-Hao Su OOD 165 11 0 04 Mar 2016