Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
M. Stallmann , North Carolina State University
The matroid parity problem is a generalization of matroid intersection and general graph matching (and hence network flow, degree-constrained subgraphs, etc.). A polynomial algorithm for linear matroids was presented by Lovasz. This paper presents an algorithm that uses time 0(mn/sup 3/), where m is the number of elements and n is the rank; for the spanning tree parity problem the time 0(mn/sup 2/). The algorithm is based on the method of augmenting paths used in the algorithms for all subcases of the problem.
M. Stallmann, H.N. Gabow, "An Augmenting Path Algorithm For The Parity Problem On Linear Matroids", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 217-228, doi:10.1109/SFCS.1984.715918