{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:37Z","timestamp":1725488617638},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441472"},{"type":"electronic","value":"9783540457268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45726-7_6","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T05:55:49Z","timestamp":1186811749000},"page":"68-77","source":"Crossref","is-referenced-by-count":2,"title":["Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Vigoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jctb.1999.1935","volume":"78","author":"G. R. Brightwell","year":"2000","unstructured":"G. R. Brightwell and P. Winkler. Gibbs measures and dismantleable graphs. J. Combin. Theory Ser. B, 78(1):141\u2013166, 2000.","journal-title":"J. Combin. Theory Ser. B"},{"key":"6_CR2","unstructured":"R. Bubley and M. Dyer. Path coupling, Dobrushin uniqueness, and approximate counting. In 38th Annual Symposium on Foundations of Computer Science, pages 223\u2013231, Miami Beach, FL, October 1997. IEEE."},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jagm.2000.1142","volume":"39","author":"C. Cooper","year":"2001","unstructured":"C. Cooper, M. Dyer, and A. Frieze. On Markov chains for randomly H-coloring a graph. J. Algorithms, 39(1):117\u2013134, 2001.","journal-title":"J. Algorithms"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P. Diaconis","year":"1993","unstructured":"P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov chains. The Annals of Applied Probability, 3(3):696\u2013730, 1993.","journal-title":"The Annals of Applied Probability"},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science","author":"M. Dyer","year":"2002","unstructured":"M. Dyer, L.A. Goldberg and M. Jerrum. Counting and Sampling H-colourings. To appear in Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, Springer-Verlag LNCS, September 2002."},{"issue":"3-4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W","volume":"17","author":"M. Dyer","year":"2000","unstructured":"M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Structures Algorithms, 17(3-4):260\u2013289, 2000.","journal-title":"Random Structures Algorithms"},{"key":"6_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-44436-X_12","volume-title":"Proceedings of APPROX 2000","author":"M. E. Dyer","year":"2000","unstructured":"M. E. Dyer, L. A. Goldberg, C. S. Greenhill, and M. R. Jerrum. On the relative complexity of approximate counting problems. In Proceedings of APPROX 2000, Lecture Notes in Computer Science vol. 1913, pages 108\u2013119, Springer Verlag, 2000."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"M. Jerrum. Mathematical foundations of the Markov chain Monte Carlo method. In Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. Mc-Diarmid, J. Ramirez-Alfonsin & B. Reed, eds), Algorithms and Combinatorics vol. 16, Springer-Verlag, 1998, 116\u2013165.","DOI":"10.1007\/978-3-662-12788-9_4"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1063\/1.533199","volume":"41","author":"D. Randall","year":"2000","unstructured":"D. Randall and P. Tetali. Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys., 41(3):1598\u20131615, 2000.","journal-title":"J. Math. Phys."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"A. Sinclair. Improved bounds for mixing rates of Markov chains and multicom-modity flow. Combinatorics, Probability and Computing, 1(4):351\u2013370, 1992.","journal-title":"Combinatorics, Probability and Computing"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45726-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T02:49:17Z","timestamp":1550717357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45726-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441472","9783540457268"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45726-7_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}