Finding all common bases in two matroids

In this paper, the authors present an algorithm for finding all common bases in two matroids. The algorithm lists all common bases by using pivot operations in such a way that each basis appears exactly once. The time complexity of the algorithm is O(n(n²+t)λ) where n is the size of the ground set of the matroids, λ is the number of common bases, and t is time to make one pivot operation. The space complexity is O(n’2) and thus does not depend on λ. As applications, the authors show how the algorithm can be applied to efficient enumerations of all complementary bases in the linear complementarity problem and all perfect matchings in a bipartite graph.