{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:33Z","timestamp":1771036353972,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438663","type":"print"},{"value":"9783540454717","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45471-3_21","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T17:18:22Z","timestamp":1179767902000},"page":"200-209","source":"Crossref","is-referenced-by-count":27,"title":["A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Golynski","sequence":"first","affiliation":[]},{"given":"Joseph D.","family":"Horton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"T. Coleman and A. Pothen. The null space problem I. Complexity. SIAM Journal of Algebraic Discrete Methods, 7, 1986.","DOI":"10.1137\/0607059"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987.","DOI":"10.1145\/28395.28396"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R. E. Gomory","year":"1961","unstructured":"R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551\u2013570, 1961.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"A. Golynski. A polynomial time algorithm to find the minimum cycle basis of a regular matroid. Master\u2019s thesis, University of New Brunswick, 2002.","DOI":"10.1007\/3-540-45471-3_21"},{"issue":"5","key":"21_CR5","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A. Goldberg","year":"1998","unstructured":"A. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45(5):783\u2013797, 1998.","journal-title":"Journal of the ACM"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"J. D. Horton","year":"1987","unstructured":"J. D. Horton. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing, 16(2):358\u2013366, 1 1987.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"P. Seymour. Decomposition of regular matroids. Journal of Combinatorial Theory (B), 1980.","DOI":"10.1016\/0095-8956(80)90075-1"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"K. Truemper. A decomposition theory for matroids.V. Testing of matrix total unimodularity. Journal of Combinatorial Theory (B), 1990.","DOI":"10.1016\/0095-8956(90)90030-4"},{"key":"21_CR9","volume-title":"Matroid Decomposition","author":"K. Truemper","year":"1992","unstructured":"K. Truemper. Matroid Decomposition. Academic Press, Boston, 1992."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.6028\/jres.069B.001","volume":"69B","author":"W. Tutte","year":"1965","unstructured":"W. Tutte. Lectures on matroids. J. Res. Nat. Bur. Standards Sect. B, 69B:1\u201347, 1965.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45471-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:42:18Z","timestamp":1556433738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45471-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438663","9783540454717"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45471-3_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}