{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T22:43:36Z","timestamp":1780785816059,"version":"3.54.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["412907"],"award-info":[{"award-number":["412907"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["413609"],"award-info":[{"award-number":["413609"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>\n            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\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>mr<\/jats:italic>\n            <jats:sup>\u03c9-1<\/jats:sup>\n            ), where\n            <jats:italic>m<\/jats:italic>\n            and\n            <jats:italic>r<\/jats:italic>\n            are the number of columns and the number of rows, respectively, and \u03c9 \u2248 2.3727 is the matrix multiplication exponent. This improves the\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>mr<\/jats:italic>\n            <jats:sup>\u03c9<\/jats:sup>\n            )-time algorithm by Gabow and Stallmann and matches the running time of the algebraic algorithm for linear matroid intersection, answering a question of Harvey. We also present a very simple alternative algorithm with running time\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>mr<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ), which does not need fast matrix multiplication.\n          <\/jats:p>\n          <jats:p>\n            We further improve the algebraic algorithms for some specific graph problems of interest. For the Mader\u2019s disjoint\n            <jats:italic>S<\/jats:italic>\n            -path problem, we present an\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\u03c9<\/jats:sup>\n            )-time randomized algorithm where\n            <jats:italic>n<\/jats:italic>\n            is the number of vertices. This improves the running time of the existing results considerably and matches the running time of the algebraic algorithms for graph matching. For the graphic matroid parity problem, we give an\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>4<\/jats:sup>\n            )-time randomized algorithm where\n            <jats:italic>n<\/jats:italic>\n            is the number of vertices, and an\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>3<\/jats:sup>\n            )-time randomized algorithm for a special case useful in designing approximation algorithms. These algorithms are optimal in terms of\n            <jats:italic>n<\/jats:italic>\n            as the input size could be \u03a9 (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>4<\/jats:sup>\n            ) and \u03a9 (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>3<\/jats:sup>\n            ), respectively.\n          <\/jats:p>\n          <jats:p>\n            The techniques are based on the algebraic algorithmic framework developed by Mucha and Sankowski, Harvey, and Sankowski. While linear matroid parity and Mader\u2019s disjoint\n            <jats:italic>S<\/jats:italic>\n            -path are challenging generalizations for the design of combinatorial algorithms, our results show that both the algebraic algorithms for linear matroid intersection and graph matching can be extended nicely to more general settings. All algorithms are still faster than the existing algorithms even if fast matrix multiplication is not used. These provide simple algorithms that can be easily implemented in practice.\n          <\/jats:p>","DOI":"10.1145\/2601066","type":"journal-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T12:56:59Z","timestamp":1401195419000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Algebraic Algorithms for Linear Matroid Parity Problems"],"prefix":"10.1145","volume":"10","author":[{"given":"Ho Yee","family":"Cheung","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai Man","family":"Leung","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9141-y"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11753728_10"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191222926"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0331751-8"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0920"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(92)90018-8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528404"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2157-8"},{"key":"e_1_2_1_9_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms. MIT Press.   T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2001. Introduction to Algorithms. MIT Press."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215915"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44485"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP). 210--220","author":"Gabow H. N.","unstructured":"H. N. Gabow and M. Stallmann . 1985. Efficient algorithms for graphic matroid intersection and parity . In Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP). 210--220 . H. N. Gabow and M. Stallmann. 1985. Efficient algorithms for graphic matroid intersection and parity. In Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP). 210--220."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579169"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63463"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0013-7"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete algorithms (SODA). 444--453","author":"Harvey N. J. A.","year":"2007","unstructured":"N. J. A. Harvey . 2007 . An algebraic algorithm for weighted linear matroid intersection . In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete algorithms (SODA). 444--453 . N. J. A. Harvey. 2007. An algebraic algorithm for weighted linear matroid intersection. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete algorithms (SODA). 444--453."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/070684008"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211014"},{"key":"e_1_2_1_21_1","volume-title":"Fete of Combinatorics and Computer Science","author":"Jord\u00e1n T.","unstructured":"T. Jord\u00e1n . 2010. Rigid and globally rigid graphs with pinned vertices . In Fete of Combinatorics and Computer Science . Bolyai Society Mathematical Studies, Vol . 20. Springer Berlin Heidelberg , 151--172. http:\/\/dx.doi.org\/10.1007\/978-3-642-13580-4_7 10.1007\/978-3-642-13580-4_7 T. Jord\u00e1n. 2010. Rigid and globally rigid graphs with pinned vertices. In Fete of Combinatorics and Computer Science. Bolyai Society Mathematical Studies, Vol. 20. Springer Berlin Heidelberg, 151--172. http:\/\/dx.doi.org\/10.1007\/978-3-642-13580-4_7"},{"key":"e_1_2_1_22_1","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976","unstructured":"E. L. Lawler . 1976 . Combinatorial Optimization: Networks and Matroids . Oxford University Press . E. L. Lawler. 1976. Combinatorial Optimization: Networks and Matroids. Oxford University Press."},{"key":"e_1_2_1_23_1","first-page":"565","article-title":"On determinants, matchings and random algorithms","volume":"79","author":"Lov\u00e1sz L.","year":"1979","unstructured":"L. Lov\u00e1sz . 1979 . On determinants, matchings and random algorithms . In Fundamentals of Computation Theory , Vol. 79. 565 -- 574 . L. Lov\u00e1sz. 1979. On determinants, matchings and random algorithms. In Fundamentals of Computation Theory, Vol. 79. 565--574.","journal-title":"Fundamentals of Computation Theory"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90066-0"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1744"},{"key":"e_1_2_1_26_1","unstructured":"L. Lov\u00e1sz and M. D. Plummer. 1986. Matching Theory. Elsevier.  L. Lov\u00e1sz and M. D. Plummer. 1986. Matching Theory. Elsevier."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01226465"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.40"},{"key":"e_1_2_1_29_1","volume-title":"Matrices and Matroids for Systems Analysis","author":"Murota K.","unstructured":"K. Murota . 2009. Matrices and Matroids for Systems Analysis . Springer Verlag . K. Murota. 2009. Matrices and Matroids for Systems Analysis. Springer Verlag."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195245"},{"key":"e_1_2_1_31_1","first-page":"17","article-title":"Connected detachments of graphs and generalized Euler trails","volume":"2","author":"St C.","year":"1985","unstructured":"C. St . J. A Nash-Williams . 1985 . Connected detachments of graphs and generalized Euler trails . Journal of the London Mathematical Society 2 , 1 (1985), 17 -- 29 . C. St. J. A Nash-Williams. 1985. Connected detachments of graphs and generalized Euler trails. Journal of the London Mathematical Society 2, 1 (1985), 17--29.","journal-title":"Journal of the London Mathematical Society"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788814.1788837"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580854"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0056-z"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250878"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.073"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS). 559--570","author":"Pr\u00f6mel H. J.","unstructured":"H. J. Pr\u00f6mel and A. Steger . 1997. RNC-approximation algorithms for the steiner problem . In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS). 559--570 . H. J. Pr\u00f6mel and A. Steger. 1997. RNC-approximation algorithms for the steiner problem. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS). 559--570."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_25"},{"key":"e_1_2_1_39_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver A.","unstructured":"A. Schrijver . 2003. Combinatorial Optimization: Polyhedra and Efficiency . Springer Verlag . A. Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag."},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO). 131--143","author":"Seb\u0151 A.","unstructured":"A. Seb\u0151 and L. Szeg\u0151 . 2004. The path-packing structure of graphs . In Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO). 131--143 . A. Seb\u0151 and L. Szeg\u0151. 2004. The path-packing structure of graphs. In Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO). 131--143."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00097-X"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_7"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(02)00045-X"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_2_1_47_1","volume-title":"The Schur Complement and Its Applications","author":"Zhang F.","unstructured":"F. Zhang . 2005. The Schur Complement and Its Applications . Springer Verlag . F. Zhang. 2005. The Schur Complement and Its Applications. Springer Verlag."}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601066","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2601066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:39Z","timestamp":1750278159000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1145\/2601066"],"URL":"https:\/\/doi.org\/10.1145\/2601066","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]},"assertion":[{"value":"2011-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}