A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.
Proceedings of the 39th Symposium on Principles of Distributed Computing , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Faster Deterministic Streaming Vertex Coloring
A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.