Greedy and randomized algorithms for dynamic edge coloring on forests achieve specific amortized recourse bounds in incremental and fully dynamic settings, with tightness results for some cases.
ICALP , year =
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
-
Dynamic Edge Coloring of Forests
Greedy and randomized algorithms for dynamic edge coloring on forests achieve specific amortized recourse bounds in incremental and fully dynamic settings, with tightness results for some cases.