A one-pass semi-streaming algorithm computes (Δ-1)-colorings for large-degree graphs without Δ-cliques, together with an Ω(n(k+1)) space lower bound for (Δ-k)-coloring when k is smaller.
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , booktitle =
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
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Beyond Brooks: $(\Delta-1)$-Coloring in Semi-Streaming
A one-pass semi-streaming algorithm computes (Δ-1)-colorings for large-degree graphs without Δ-cliques, together with an Ω(n(k+1)) space lower bound for (Δ-k)-coloring when k is smaller.