{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:46Z","timestamp":1725564766703},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_2","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"13-22","source":"Crossref","is-referenced-by-count":1,"title":["Matching, Edge-Colouring, and Dimers"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Schrijver","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Bang, T.: On matrix-functions giving a good approximation to the v.d.Waerden permanent conjecture. Preprint Series 1979 No. 30, Matematisk Institut, K\u00f8benhavns Universitet, Copenhagen (1979)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1006\/jcph.1998.6149","volume":"149","author":"I. Beichl","year":"1999","unstructured":"Beichl, I., Sullivan, F.: Approximating the permanent via importance sampling with application to the dimer covering problem. Journal of Computational Physics\u00a0149, 128\u2013147 (1999)","journal-title":"Journal of Computational Physics"},{"key":"2_CR3","unstructured":"Cole, R.J.: Two Problems in Graph Theory, Ph.D. Thesis, Cornell University, Ithaca, New York (1982)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM Journal on Computing\u00a011, 540\u2013546 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(ElogD) time. Combinatorica\u00a021, 5\u201312 (2001)","journal-title":"Combinatorica"},{"key":"2_CR6","first-page":"459","volume":"3","author":"P. Erd\u00f6s","year":"1968","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random matrices II. Studia Scientiarum Mathematicarum Hungarica\u00a03, 459\u2013464 (1968)","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"2_CR7","first-page":"931","volume":"29","author":"D.I. Falikman","year":"1981","unstructured":"Falikman, D.I.: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix. Matematicheskie Zametki\u00a029, 931\u2013938 (1981) (in Russian); English translation: Mathematical Notes of the Academy of Sciences of the USSR 29, 475\u2013479 (1981)","journal-title":"Matematicheskie Zametki"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jcss.1995.1065","volume":"51","author":"T. Feder","year":"1995","unstructured":"Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. Journal of Computer and System Sciences\u00a051, 261\u2013272 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.2307\/1971250","volume":"110","author":"S. Friedland","year":"1979","unstructured":"Friedland, S.: A lower bound for the permanent of a doubly stochastic matrix. Annals of Mathematics\u00a0110, 167\u2013176 (1979)","journal-title":"Annals of Mathematics"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00998632","volume":"5","author":"H.N. Gabow","year":"1976","unstructured":"Gabow, H.N.: Using Euler partitions to edge color bipartite multigraphs. International Journal of Computer and Information Sciences\u00a05, 345\u2013355 (1976)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"2_CR11","first-page":"125","volume-title":"Research Papers in Statistics [Festschrift for J. Neyman]","author":"J.M. Hammersley","year":"1966","unstructured":"Hammersley, J.M.: Existence theorems and Monte Carlo methods for the monomerdimer problem. In: David, F.N. (ed.) Research Papers in Statistics [Festschrift for J. Neyman], pp. 125\u2013146. Wiley, London (1966)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0020-0190(81)90142-3","volume":"13","author":"O.H. Ibarra","year":"1981","unstructured":"Ibarra, O.H., Moran, S.: Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication. Information Processing Letters\u00a013, 12\u201315 (1981)","journal-title":"Information Processing Letters"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/0031-8914(61)90063-5","volume":"27","author":"P.W. Kasteleyn","year":"1961","unstructured":"Kasteleyn, P.W.: The statistics of dimers on a lattice. I: the number of dimer arrangements on a quadratic lattice. Physica\u00a027, 1209\u20131225 (1961)","journal-title":"Physica"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0012-365X(00)00329-0","volume":"231","author":"P.H. Lundow","year":"2001","unstructured":"Lundow, P.H.: Compression of transfer matrices. Discrete Mathematics\u00a0231, 321\u2013329 (2001)","journal-title":"Discrete Mathematics"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1006\/jctb.1997.1798","volume":"72","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Counting 1-factors in regular bipartite graphs. Journal of Combinatorial Theory, Series B\u00a072, 122\u2013135 (1998)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A. Schrijver","year":"1999","unstructured":"Schrijver, A.: Bipartite edge-colouring in O(\u0394m) time. SIAM Journal on Computing\u00a028, 841\u2013846 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/1385-7258(80)90043-8","volume":"42","author":"A. Schrijver","year":"1980","unstructured":"Schrijver, A., Valiant, W.G.: On lower bounds for permanents. Indagationes Mathematicae\u00a042, 425\u2013427 (1980)","journal-title":"Indagationes Mathematicae"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania (1983)","DOI":"10.1137\/1.9781611970265"},{"issue":"8","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1080\/14786436108243366","volume":"6","author":"H.N.V. Temperley","year":"1961","unstructured":"Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics \u2014 an exact result. Philosophical Magazine\u00a06(8), 1061\u20131063 (1961)","journal-title":"Philosophical Magazine"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/1385-7258(79)90012-X","volume":"41","author":"M. Voorhoeve","year":"1979","unstructured":"Voorhoeve, M.: A lower bound for the permanents of certain (0, 1)-matrices. Indagationes Mathematicae\u00a041, 83\u201386 (1979)","journal-title":"Indagationes Mathematicae"},{"key":"2_CR22","first-page":"117","volume":"35","author":"B.L. Waerden van der","year":"1926","unstructured":"van der Waerden, B.L.: [Aufgabe] 45. Jahresbericht der Deutschen Mathematiker- Vereinigung\u00a035, 117 (1926)","journal-title":"Jahresbericht der Deutschen Mathematiker- Vereinigung"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T22:23:17Z","timestamp":1553034197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}