{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:48:50Z","timestamp":1648907330440},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540436768","type":"print"},{"value":"9783540478676","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_2","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:47:17Z","timestamp":1179946037000},"page":"9-20","source":"Crossref","is-referenced-by-count":6,"title":["A Generalization of Edmonds\u2019 Matching and Matroid Intersection Algorithms"],"prefix":"10.1007","author":[{"given":"Bianca","family":"Spille","sequence":"first","affiliation":[]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"C. Berge, Two theorems in graph theory, Proceedings of the National Academy of Sciences (U.S.A.) 43, 842\u2013844, 1957","journal-title":"Proceedings of the National Academy of Sciences (U.S.A.)"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"W. H. Cunningham","year":"1997","unstructured":"W. H. Cunningham and J. F. Geelen, The optimal path-matching problem, Combinatorica 17, no. 3, 315\u2013337, 1997","journal-title":"Combinatorica"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"11","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 11, 449\u2013467, 1965","journal-title":"Canadian Journal of Mathematics"},{"key":"2_CR4","unstructured":"J. Edmonds, Matroid partition, Math. Decision Sciences, Proceedings 5th Summer Seminary Stanford 1967, Part 1 (Lectures of Applied Mathematics 11), 335\u2013345, 1968"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, Matroid Intersection, Annals of Discrete Mathematics 4, 39\u201349, 1979","journal-title":"Annals of Discrete Mathematics"},{"key":"2_CR6","unstructured":"A. Frank and L. Szeg\u00f6, A note on the path-matching formula, EGRES Technical Report No. 2001-03, 2001"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"E. L. Lawler","year":"1975","unstructured":"E. L. Lawler, Matroid intersection algorithms, Mathematical Programming 9, 31\u201356, 1975","journal-title":"Mathematical Programming"},{"key":"2_CR8","unstructured":"E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York etc., 1976"},{"key":"2_CR9","unstructured":"B. Spille and R. Weismantel, A Combinatorial Algorithm for the Independent Path-Matching Problem, Manuscript, 2001"}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:40:15Z","timestamp":1550353215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":9,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-47867-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2002]]}}}