---

Algorithm for matroid intersection: Augmentation to intersection

Finding maximum matching on bipartite graphs is
one of the fundamental problems in graph algorithms.
This algorithm can surprisingly be generalized to compute
a maximum-sized independent set in the intersection of
two matroids. This talk will give details of this algorithm.