{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:02Z","timestamp":1725536822202},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_13","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"137-148","source":"Crossref","is-referenced-by-count":1,"title":["Sampling Edge Covers in 3-Regular Graphs"],"prefix":"10.1007","author":[{"given":"Ivona","family":"Bez\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William A.","family":"Rummler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1017\/S0963548306007978","volume":"16","author":"C. Cooper","year":"2007","unstructured":"Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and a peer- to-peer network. Combinatorics, Probability and Computing\u00a016, 557\u2013593 (2007)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P. Diaconis","year":"1993","unstructured":"Diaconis, P., Saloff-Coste, L.: Comparison Theorems for Reversible Markov Chains. The Annals of Applied Probability\u00a03(3), 696\u2013730 (1993)","journal-title":"The Annals of Applied Probability"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1214\/aoap\/1177005980","volume":"1","author":"P. Diaconis","year":"1991","unstructured":"Diaconis, P., Stroock, D.: Geometric Bounds for Eigenvalues of Markov Chains. The Annals of Applied Probability\u00a01(1), 36\u201361 (1991)","journal-title":"The Annals of Applied Probability"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM Journal on Computing\u00a018, 1149\u20131178 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"M. Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation\u00a082, 93\u2013133 (1989)","journal-title":"Information and Computation"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. J. ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"J. ACM"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","volume":"14","author":"R. Kannan","year":"1999","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Structures and Algorithms (RSA)\u00a014(4), 293\u2013308 (1999)","journal-title":"Random Structures and Algorithms (RSA)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539799360355","volume":"31","author":"M. Luby","year":"2001","unstructured":"Luby, M., Randall, D., Sinclair, A.: Markov chain algorithms for planar lattice structures. SIAM Journal on Computing\u00a031, 167\u2013192 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1063\/1.533199","volume":"41","author":"D. Randall","year":"2000","unstructured":"Randall, D., Tetali, P.: Analyzing Glauber dynamics by comparison of Markov chains. Journal of Mathematical Physics\u00a041, 1598\u20131615 (2000)","journal-title":"Journal of Mathematical Physics"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"Sinclair, A.: Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. Combinatorics, Probability and Computing\u00a01, 351\u2013370 (1992)","journal-title":"Combinatorics, Probability and Computing"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Vigoda, E.: A note on the Glauber dynamics for sampling independent sets. Electronic Journal of Combinatorics\u00a08(1) (2001); Research paper 8","DOI":"10.37236\/1552"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T14:58:05Z","timestamp":1590073085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}