{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:33Z","timestamp":1725570453655},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_40","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"451-462","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Algorithm for the Maximum Even Factor Problem"],"prefix":"10.1007","author":[{"given":"Maxim A.","family":"Babenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"Balas, E., Pulleyblank, W.: The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica\u00a09, 321\u2013337 (1989)","journal-title":"Combinatorica"},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070100256","volume":"91","author":"W.H. Cunningham","year":"2002","unstructured":"Cunningham, W.H.: Matching, matroids, and extensions. Mathematical Programming\u00a091(3), 515\u2013542 (2002)","journal-title":"Mathematical Programming"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"W.H. Cunningham","year":"1997","unstructured":"Cunningham, W.H., Geelen, J.F.: The optimal path-matching problem. Combinatorica\u00a017, 315\u2013337 (1997)","journal-title":"Combinatorica"},{"key":"40_CR4","unstructured":"Cunningham, W.H., Geelen, J.F.: Combinatorial algorithms for path-matching (2000) (manuscript)"},{"key":"40_CR5","unstructured":"Cunningham, W.H., Geelen, J.F.: Vertex-disjoint dipaths and even dicircuits (2001) (manuscript)"},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR7","unstructured":"Iwata, S., Takazawa, K.: The independent even factor problem. In: Proceeinds of the 18th Annual ACM-SIAM Symposium on Discrete algorithms, pp. 1171\u20131180 (2007)"},{"issue":"1","key":"40_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jctb.2008.05.001","volume":"99","author":"Y. Kobayashi","year":"2009","unstructured":"Kobayashi, Y., Takazawa, K.: Even factors, jump systems, and discrete convexity. J. Comb. Theory Ser. B\u00a099(1), 139\u2013161 (2009)","journal-title":"J. Comb. Theory Ser. B"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An O( $\\sqrt{|V|}$ .|E|) algorithm for finding maximum matching in general graphs. In: Proc. 45th IEEE Symp. Foundations of Computer Science, pp. 248\u2013255 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Pap, G.: A combinatorial algorithm to find a maximum even factor. In: Proceedings of the 11th Integer International IPCO Conference on Programming and Combinatorial Optimization, pp. 66\u201380 (2005)","DOI":"10.1007\/11496915_6"},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-006-0053-9","volume":"110","author":"G. Pap","year":"2007","unstructured":"Pap, G.: Combinatorial algorithms for matchings, even factors and square-free 2-factors. Math. Program.\u00a0110(1), 57\u201369 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"40_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jctb.2004.01.001","volume":"91","author":"G. Pap","year":"2004","unstructured":"Pap, G., Szeg\u00f6, L.: On the maximum even factor in weakly symmetric graphs. J. Comb. Theory Ser. B\u00a091(2), 201\u2013213 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Spille, B., Weismantel, R.: A generalization of Edmonds\u2019 matching and matroid intersection algorithms. In: Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp. 9\u201320 (2002)","DOI":"10.1007\/3-540-47867-1_2"},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10107-007-0154-0","volume":"115","author":"K. Takazawa","year":"2008","unstructured":"Takazawa, K.: A weighted even factor algorithm. Mathematical Programming\u00a0115(2), 223\u2013237 (2008)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:25Z","timestamp":1559836165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}