Locality in online, dynamic, sequential, and distributed graph
algorithms

v1v2v3v4 (latest)

Locality in online, dynamic, sequential, and distributed graph algorithms

14 September 2021

Henrik Lievonen

Joona Särkijärvi

ArXiv (abs)PDF HTML

Papers citing "Locality in online, dynamic, sequential, and distributed graph algorithms"

4 / 4 papers shown

Title
Distributed Quantum Advantage for Local Problems Alkida Balliu S. Brandt Xavier Coiteux-Roy Francesco d’Amore Massimo Equi ... Dennis Olivetti M. Renou Jukka Suomela Lucas Tendick Isadora Veeren 36 5 0 05 Nov 2024
Shared Randomness Helps with Local Distributed Problems Alkida Balliu Mohsen Ghaffari Fabian Kuhn Augusto Modanese Dennis Olivetti Mikael Rabie Jukka Suomela Jara Uitto 69 4 0 07 Jul 2024
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 62 2 0 03 Dec 2023
No distributed quantum advantage for approximate graph coloring Xavier Coiteux-Roy Francesco d’Amore Rishikesh R. Gajjala Fabian Kuhn Franccois Le Gall Henrik Lievonen Augusto Modanese M. Renou Gustav Schmid Jukka Suomela 74 15 0 18 Jul 2023