# A note on Cunningham's algorithm for matroid intersection

arXiv: https://arxiv.org/abs/1904.04129 · HTML: https://mlsanity.com/paper/1904.04129/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Apr 2019.

## Built on by (most cited first, 1 of 1)

- [Streaming Algorithms for Diversity Maximization with Fairness Constraints](https://mlsanity.com/paper/2208.00194/) (2022)

## 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.