ResearchTrend.AI
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

Dan Hefetz
Fabian Kuhn
Yannic Maus
Angelika Steger
ArXiv (abs)PDFHTML

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

6 / 6 papers shown
Title
Fast Distributed Brooks' Theorem
Fast Distributed Brooks' Theorem
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
41
17
0
14 Nov 2022
Distributed Graph Coloring Made Easy
Distributed Graph Coloring Made Easy
Yannic Maus
51
25
0
12 May 2021
Faster Deterministic Distributed Coloring Through Recursive List Coloring
Faster Deterministic Distributed Coloring Through Recursive List Coloring
Fabian Kuhn
43
34
0
08 Jul 2019
Distributed Computing in the Asynchronous LOCAL model
Distributed Computing in the Asynchronous LOCAL model
C. Delporte-Gallet
H. Fauconnier
Pierre Fraigniaud
Mikael Rabie
LRM
33
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
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
49
70
0
01 Dec 2017
A Time Hierarchy Theorem for the LOCAL Model
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
50
102
0
20 Apr 2017

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.