Sinkless orientation is hard also in the supported LOCAL model

Sinkless orientation is hard also in the supported LOCAL model

Abstract

We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).

Grafik Top
Authors
  • Korhonen, Janne H.
  • Paz, Ami
  • Rybicki, Joel
  • Schmid, Stefan
  • Suomela, Jukka
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
International Symposium on Distributed Computing (DISC)
Divisions
Communication Technologies
Theory and Applications of Algorithms
Subjects
Informatik Allgemeines
Event Location
Freiburg, Germany
Event Type
Conference
Event Dates
October 2021
Date
2021
Export
Grafik Top