{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:27Z","timestamp":1725490227067},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742074"},{"type":"electronic","value":"9783540742081"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_21","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T10:52:26Z","timestamp":1188211946000},"page":"286-295","source":"Crossref","is-referenced-by-count":0,"title":["Almost Exact Matchings"],"prefix":"10.1007","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N. Alon","year":"1990","unstructured":"Alon, N., Seymour, P.D., Thomas, R.: A separator theorem for nonplanar graphs. J. Amer. Math. Soc.\u00a03(4), 801\u2013808 (1990)","journal-title":"J. Amer. Math. Soc."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbol. Comput.\u00a09, 251\u2013280 (1990)","journal-title":"J. Symbol. Comput."},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. Journal of the ACM\u00a038(4), 815\u2013853 (1991)","journal-title":"Journal of the ACM"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A. George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Analysis\u00a010, 345\u2013363 (1973)","journal-title":"SIAM J. Numer. Analysis"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF01396660","volume":"50","author":"J.R. Gilbert","year":"1987","unstructured":"Gilbert, J.R., Tarjan, R.E.: The analysis of a nested dissection algorithm. Numerische Mathematik\u00a050(4), 377\u2013404 (1987)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a Graph into Triconnected Components. SIAM J. Comput.\u00a02(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02579407","volume":"6","author":"R. Karp","year":"1986","unstructured":"Karp, R., Upfal, E., Wigderson, A.: Constructing a perfect matching is in Random NC. Combinatorica\u00a06, 35\u201348 (1986)","journal-title":"Combinatorica"},{"key":"21_CR8","first-page":"43","volume-title":"Graph Theory and Theoretical Physics","author":"P.W. Kasteleyn","year":"1967","unstructured":"Kasteleyn, P.W.: Graph theory and crystal physics. In: Graph Theory and Theoretical Physics, pp. 43\u2013110. Academic Press, London (1967)"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Analysis\u00a016(2), 346\u2013358 (1979)","journal-title":"SIAM J. Numer. Analysis"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Applied Math.\u00a036(2), 177\u2013189 (1979)","journal-title":"SIAM J. Applied Math."},{"key":"21_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BFb0057377","volume-title":"Combinatorial Mathematics. Proc. 2 nd Australian Conference","author":"C.H.C. Little","year":"1974","unstructured":"Little, C.H.C.: An extension of Kasteleyn\u2019s method of enumerating the 1-factors of planar graphs. In: Holton, D. (ed.) Combinatorial Mathematics. Proc. 2\n nd\n Australian Conference. Lecture Notes in Mathematics, vol.\u00a0403, pp. 63\u201372. Springer, Heidelberg (1974)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-540-30140-0_48","volume-title":"Algorithms \u2013 ESA 2004","author":"M. Mucha","year":"2004","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings in planar graphs via Gaussian elimination. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 532\u2013543. Springer, Heidelberg (2004)"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica\u00a07(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted spanning tree problems. Journal of the ACM\u00a029(2), 285\u2013309 (1982)","journal-title":"Journal of the ACM"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W.T. Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc.\u00a022, 107\u2013111 (1947)","journal-title":"J. London Math. Soc."},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0890-5401(89)90017-5","volume":"80","author":"V.V. Vazirani","year":"1989","unstructured":"Vazirani, V.V.: NC algorithms for computing the number of perfect matchings in K\n 3,3-free graphs and related problems. Inf. Comput.\u00a080(2), 152\u2013164 (1989)","journal-title":"Inf. Comput."},{"key":"21_CR17","unstructured":"Yuster, R., Zwick, U.: Maximum matching in graphs with an excluded minor. In: Proc. of 18th SODA, ACM\/SIAM, pp. 108\u2013117 (2007)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74208-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:24:47Z","timestamp":1550874287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-540-74208-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}
