A note on Cunningham's algorithm for matroid intersection
Not on the map. Why?
Abstract (arXiv)
In the matroid intersection problem, we are given two matroids of rank r on a common ground set E of n elements and the goal is to find the maximum set that is independent in both matroids. In this note, we show that Cunningham's algorithm for matroid intersection can be implemented to use O(nrlog2(r)) independent oracle calls.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 8 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.