Caching Connections in Matchings
cs.DS
Submitted: 2023-10-21
Updated: 2026-11-04
Terminology
Sources
- An Online Matching Model for Self-Adjusting ToR-to-ToR Networks
- On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
- Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity
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