Proceedings
Symposium on Simplicity in Algorithms (SOSA)
Sinkless Orientation Made Simple
Pages 175 - 191
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 Ω(log n) in the deterministic LOCAL model and O(log log n) 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.
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
Symposium on Simplicity in Algorithms (SOSA)
Pages: 175 - 191
Editors: Telikepalli Kavitha, Tata Institute of Fundamental Research, Mumbai, India and Kurt Mehlhorn, Max Planck Institute for Informatics, Germany
ISBN (Online): 978-1-61197-758-5
Copyright
© 2023 by the Society for Industrial and Applied Mathematics.
History
Published online: 12 January 2023
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Tight Lower Bounds in the Supported LOCAL ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing | 17 June 2024
- Distributed Binary Labeling Problems in High-Degree GraphsStructural Information and Communication Complexity | 23 May 2024
- Brief Announcement: Local Problems in the SUPPORTED ModelProceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 16 June 2023
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].