Algebraic Algorithms for Linear Matroid Parity Problems
ACM Transactions on Algorithms, 2014.
We present fast and simple algebraic algorithms for the linear matroid parity problem and its applications. For the linear matroid parity problem, we obtain a simple randomized algorithm with running time O(mrω-1), where m and r are the number of columns and the number of rows, respectively, and ω ≈ 2.3727 is the matrix multiplication ...More
PPT (Upload PPT)