Abstract
Linear matroid parity generalizes matroid intersection and graph matching (and hence network flow, degree-constrained subgraphs, etc.). A polynomial algorithm was given by Lovasz. This paper presents an algorithm that uses timeO(mn 3), wherem is the number of elements andn is the rank. (The time isO(mn 2.5) using fast matrix multiplication; both bounds assume the uniform cost model). For graphic matroids the time isO(mn 2). The algorithm is based on the method of augmenting paths used in the algorithms for all subcases of the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.