A W-streaming edge coloring algorithm uses O(delta to the 4/3 plus epsilon) colors with near-linear space, improving the prior randomized delta to 1.5 bound and giving the first deterministic subquadratic result.
Dynamic Algorithms for Graph Coloring
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
-
Improved Streaming Edge Coloring
A W-streaming edge coloring algorithm uses O(delta to the 4/3 plus epsilon) colors with near-linear space, improving the prior randomized delta to 1.5 bound and giving the first deterministic subquadratic result.