An O(n 0.1537) -Coloring Algorithm for 3-Colorable Graphs
cs.DS
Submitted: 2026-10-26
Updated: 2026-10-26
Related papers
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- Computational and Statistical Hardness of Calibration Distance
- Edge-Private Matching Kernels Through Local Decoding
- Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
- Local Node Differential Privacy
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing