A King for Almost Everyone
cs.DS, cs.CC, cs.DM, math.CO
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- A King in every two consecutive tournaments
- Directed Cut-Query Complexity of Finding a King
- On the communication complexity of finding a king in a tournament
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