Faster graphic matroid parity: Breaking the nm time complexity barrier
cs.DS
Submitted: 2026-11-01
Updated: 2026-11-11
Terminology
Sources
- Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model
- A Weighted-to-Unweighted Reduction for Matroid Intersection
- Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
- Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
- Maximum Cardinality Matching in n 2+o(1) Time
- Solving Linear Programs with Sqrt(rank) Linear System Solves
- A note on Cunningham's algorithm for matroid intersection
- Adaptive Sparsification for Linear Programming
- A Faster Auction Algorithm for Weighted Matroid Intersection
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