ResearchTrend.AI
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model

Yi-Jun Chang
Gopinath Mishra
Hung Thuan Nguyen
Mingyang Yang
Yu-Cheng Yeh
ArXivPDFHTML

Papers citing "A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model"

2 / 2 papers shown
Title
Locality in online, dynamic, sequential, and distributed graph algorithms
Locality in online, dynamic, sequential, and distributed graph algorithms
Amir Akbari
N. Eslami
Henrik Lievonen
Darya Melnyk
Joona Särkijärvi
Jukka Suomela
35
9
0
14 Sep 2021
A Time Hierarchy Theorem for the LOCAL Model
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
43
96
0
20 Apr 2017