The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(logn) in the deterministic LOCAL model and O(loglogn) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them.
@article{arxiv.2108.02655,
title = {Sinkless Orientation Made Simple},
author = {Alkida Balliu and Janne H. Korhonen and Fabian Kuhn and Henrik Lievonen and Dennis Olivetti and Shreyas Pai and Ami Paz and Joel Rybicki and Stefan Schmid and Jan Studený and Jukka Suomela and Jara Uitto},
journal= {arXiv preprint arXiv:2108.02655},
year = {2022}
}
Comments
Parts of this work appeared in DISC 2021 as a brief announcement, under the title "Sinkless orientation is hard also in the supported LOCAL model"