First local-computation-algorithm treatment of low-out-degree edge orientation, with a Ω(√n/r) lower bound on forests and sublinear r-orientation and 4-coloring algorithms for bounded-degree forests.
On d erandomizing local distributed algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Locally computing edge orientations
First local-computation-algorithm treatment of low-out-degree edge orientation, with a Ω(√n/r) lower bound on forests and sublinear r-orientation and 4-coloring algorithms for bounded-degree forests.