BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-74-468
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A combinatorial base for some optimal matroid intersection
               algorithms.
        TYPE:: Technical Report
      AUTHOR:: Krogdahl, Stein
        DATE:: November 1974
       PAGES:: 30
    ABSTRACT:: E. Lawler has 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.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-74-468