{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T04:16:24Z","timestamp":1692677784636},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T00:00:00Z","timestamp":1484006400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00493-016-3445-3","type":"journal-article","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T03:34:43Z","timestamp":1484019283000},"page":"167-191","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Girth and Cogirth in Perturbed Graphic Matroids"],"prefix":"10.1007","volume":"38","author":[{"given":"Jim","family":"Geelen","sequence":"first","affiliation":[]},{"given":"Rohan","family":"Kapadia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,10]]},"reference":[{"key":"3445_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(87)90097-5","volume":"66","author":"F. Barahona","year":"1987","unstructured":"F. Barahona and M. Conforti: A construction for binary matroids, Discrete Math. 66 (1987), 213\u2013218.","journal-title":"Discrete Math."},{"key":"3445_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.12.2.193","volume":"12","author":"M. Conforti","year":"1987","unstructured":"M. Conforti and M. R. Rao: Some new matroids on graphs: Cut sets and the max cut problem, Math. Oper. Res. 12 (1987), 193\u2013204.","journal-title":"Math. Oper. Res."},{"key":"3445_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00026-015-0251-3","volume":"19","author":"J. Geelen","year":"2015","unstructured":"J. Geelen, B. Gerards and G. Whittle: The highly-connected matroids in minorclosed classes, Ann. Comb. 19 (2015), 107\u2013123.","journal-title":"Ann. Comb."},{"key":"3445_CR4","volume-title":"Algebraic Combinatorics","author":"C. D. Godsil","year":"1993","unstructured":"C. D. Godsil: Algebraic Combinatorics, Chapman and Hall, New York, 1993."},{"key":"3445_CR5","first-page":"84","volume-title":"Proc. 4th Annu. ACM-SIAM Symposium on Discrete Algorithms","author":"D. R. Karger","year":"1993","unstructured":"D. R. Karger: Global min-cuts in RNC, and other ramifications of a simple mincut algorithm, in: Proc. 4th Annu. ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1993, 84\u201393."},{"key":"3445_CR6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D. R. Karger","year":"1996","unstructured":"D. R. Karger and C. Stein: A new approach to the minimum cut problem, J. ACM 43 (1996), 601\u2013640.","journal-title":"J. ACM"},{"key":"3445_CR7","first-page":"565","volume-title":"Fundamentals of Computation Theory","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz: On determinants, matchings, and random algorithms, in: Fundamentals of Computation Theory (L. Budach, ed.), Akademie-Verlag, Berlin, 1979, 565\u2013574."},{"key":"3445_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/28395.383347","volume-title":"Proc. STOC\u2019 87 Proceedings of the nineteenth annual ACM symposium on Theory of computing","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, U. V. Vazirani and V. V. Vazirani: Matching is as easy as matrix inversion, in: Proc. STOC\u2019 87 Proceedings of the nineteenth annual ACM symposium on Theory of computing, ACM, New York, 1987, 345\u2013354."},{"key":"3445_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2003.12.001","volume":"143","author":"M. Mahajan","year":"2004","unstructured":"M. Mahajan, P. R. Subramanya and V. Vinay: The combinatorial approach yields an NC algorithm for computing Pfaffians, Discrete Appl. Math. 143 (2004), 1\u201316.","journal-title":"Discrete Appl. Math."},{"key":"3445_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"1","author":"M. W. Padberg","year":"1982","unstructured":"M. W. Padberg and M. R. Rao: Odd minimum cut-sets and b-matchings, Math. Oper. Res. 1 (1982), 67\u201380.","journal-title":"Math. Oper. Res."},{"key":"3445_CR11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz: Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980), 701\u2013717.","journal-title":"J. ACM"},{"key":"3445_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"21","author":"W. T. Tutte","year":"1947","unstructured":"W. T. Tutte: The factorization of linear graphs, J. London Math. Soc. 21 (1947), 107\u2013111.","journal-title":"J. London Math. Soc."},{"key":"3445_CR13","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"A. Vardy: The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory 43 (1997), 1757\u20131766.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3445_CR14","first-page":"216","volume-title":"Proc. EUROSAM 79","author":"R. Zippel","year":"1979","unstructured":"R. Zippel: Probabilistic algorithms for sparse polynomials, in: Proc. EUROSAM 79 (Edward W. Ng, ed.), Lecture Notes in Compu. Sci. 72, Springer-Verlag, Berlin, 1979, 216\u2013226."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3445-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3445-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3445-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T17:13:02Z","timestamp":1692637982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3445-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["3445"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3445-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,10]]}}}