{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:59:16Z","timestamp":1786978756872,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583257","type":"print"},{"value":"9783540486534","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_231","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:45:53Z","timestamp":1330253153000},"page":"625-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast algorithms for transversal matroid intersection problems"],"prefix":"10.1007","author":[{"given":"Ying","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harold N.","family":"Gabow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Glover","year":"1967","unstructured":"F. Glover, \u201cMaximum Matching in a Convex Bipartite Graph\u201d, Naval Res. Logist. Quart., 14, 1967, pp. 313\u2013316.","journal-title":"Naval Res. Logist. Quart."},{"key":"73_CR2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","volume":"5","author":"H.N. Gabow","year":"1984","unstructured":"H.N. Gabow and R.E. Tarjan, \u201cEfficient algorithms for a family of matroid intersection problems\u201d, J. of Algorithms, 5, 1984, pp. 80\u2013131.","journal-title":"J. of Algorithms"},{"issue":"5","key":"73_CR3","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H.N. Gabow","year":"1989","unstructured":"H.N. Gabow and R.E. Tarjan, \u201cFaster scaling algorithms for network problems\u201d, SIAM J. Comp., 18, 5, 1989, pp. 1013\u20131036.","journal-title":"SIAM J. Comp."},{"key":"73_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry","author":"K. Melhorn","year":"1984","unstructured":"K. Melhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer-Verlag, New York, 1984."},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"P. Tong, E.L. Lawler and V.V. Vazirani, \u201cSolving the weighted parity problems for gammoids by reduction to graphic matching\u201d, Combinatorial Optimization, W.R. Pulleyblank, ed., Academic Press, 1984, pp. 363\u2013374.","DOI":"10.1016\/B978-0-12-566780-7.50026-X"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:19:00Z","timestamp":1578518340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_231"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_231","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}