A THEORETICAL BASE FOR SOME OPTIMAL MATROID INTERSECTION ALGORITHMS

摘要

E. Lawler has earlier given an algorithm for finding maximum weight intersections for a pair of matroids, using linear programming concepts and constructions to prove its correctness. In this paper another theoretical base for this algorithm is given which depends only on the basic properties of matroids, and which involves no linear programming concepts.