Reproduce “Constant-Time Dynamic Edge Coloring via Dynamic Splitting and LLL” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Mohsen Ghaffari, Sijin Peng

The authors present a dynamic algorithm that maintains a proper edge coloring after insertions and deletions, using at most (1+ε)Δ colors. It splits edges into lower-degree pieces and maintains the final partition without checking every intermediate level. For simple graphs with Δ≥Δε=~Θ(1/ε²), updates take poly(1/ε) worst-case expected time against an oblivious adversary, independent of graph size and Δ.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.