Sinkless Orientation Made Simple
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis, Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studen\'y,, Jukka Suomela, Jara Uitto
TL;DR
This paper provides simplified, self-contained proofs for the complexity of sinkless orientation, clarifying the separation between LOCAL and SLOCAL models in distributed graph algorithms.
Contribution
It introduces new, simple proofs for existing bounds on sinkless orientation, enhancing understanding of distributed computing models.
Findings
Deterministic LOCAL model requires ( n) rounds
Deterministic SLOCAL model requires ( n) rounds
Clarifies the separation between LOCAL and SLOCAL models
Abstract
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 in the deterministic LOCAL model and 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Optimization and Search Problems