Exact Tie-Breaking and Tight Degree Bounds for Minimum-Degree Greedy on Interval Graphs
cs.DS
Submitted: 2026-11-01
Updated: 2026-11-03
Comments: 23 pages, 3 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time