New bounds for online coloring three-colorable graphs
cs.DS
Submitted: 2026-10-30
Updated: 2026-10-30
Related papers
- A Faster Auction Algorithm for Weighted Matroid Intersection
- Sampling Sphere Packings with Continuum Glauber Dynamics
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- A Deterministic Near-Linear Time Approximation Algorithm for Restricted Shortest Paths in Directed Graphs
- Computational and Statistical Hardness of Calibration Distance
- Edge-Private Matching Kernels Through Local Decoding