New temporal aggregation resampling schemes maintain approximately random assignments against adaptive adversaries, supporting O(Δ) coloring of general graphs and O(Δ/ln Δ) coloring of triangle-free graphs with sublinear average work per modification.
Akyildiz, Yi-Bing Lin, Wei-Ru Lai, and Rong-Jaye Chen
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Maintaining Random Assignments under Adversarial Dynamics
New temporal aggregation resampling schemes maintain approximately random assignments against adaptive adversaries, supporting O(Δ) coloring of general graphs and O(Δ/ln Δ) coloring of triangle-free graphs with sublinear average work per modification.