{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:23Z","timestamp":1725579023850},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_37","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"377-389","source":"Crossref","is-referenced-by-count":0,"title":["The Cover Time of Cartesian Product Graphs"],"prefix":"10.1007","author":[{"given":"Mohammed","family":"Abdullah","sequence":"first","affiliation":[]},{"given":"Colin","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(96)00002-9","volume":"73","author":"B. Bollobas","year":"1997","unstructured":"Bollobas, B., Brightwell, G.: Random walks and electrical resistances in product graphs. Discrete Applied Mathematics\u00a073, 69\u201379 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01270385","volume":"6","author":"A.K. Chandra","year":"1997","unstructured":"Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Computational Complexity\u00a06, 312\u2013340 (1997)","journal-title":"Computational Complexity"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.4007\/annals.2004.160.433","volume":"160","author":"A. Dembo","year":"2004","unstructured":"Dembo, A., Peres, Y., Rosen, J., Zeitouni, O.: Cover times for Brownian motion and random walks in two dimensions. Ann. Math.\u00a0160, 433\u2013464 (2004)","journal-title":"Ann. Math."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Ding, J., Lee, J.R., Peres, Y.: Cover times, blanket times and majorizing measures (2010) (manuscript)","DOI":"10.1145\/1993636.1993646"},{"key":"37_CR6","unstructured":"Doyle, P.G., Laurie Snell, J.: Random walks and electrical networks (2006)"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige, U.: A tight upper bound for the cover time of random walks on graphs. Random Structures and Algorithms\u00a06, 51\u201354 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/rsa.3240060406","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige, U.: A tight lower bound for the cover time of random walks on graphs. Random Structures and Algorithms\u00a06, 433\u2013438 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0012-365X(00)00013-3","volume":"222","author":"J. Jonasson","year":"2000","unstructured":"Jonasson, J.: An upper Bound on the Cover Time for Powers of Graphs. Discrete Mathematics\u00a0222, 181\u2013190 (2000)","journal-title":"Discrete Mathematics"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times (2009)","DOI":"10.1090\/mbk\/058"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1214\/aop\/1176991894","volume":"16","author":"P. Matthews","year":"1988","unstructured":"Matthews, P.: Covering problems for Brownian motion on spheres. Ann. Prob.\u00a016, 189\u2013199 (1988); Nash-Williams, C.S.J.A.: Random walk and electric currents in networks. Proc. Camb. Phil. Soc. 55, 181\u2013194 (1959)","journal-title":"Ann. Prob."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1002\/(SICI)1098-2418(199612)9:4<403::AID-RSA4>3.0.CO;2-0","volume":"9","author":"P. Winkler","year":"1996","unstructured":"Winkler, P., Zuckerman, D.: Multiple Cover Time. Random Structures and Algorithms\u00a09, 403\u2013411 (1996)","journal-title":"Random Structures and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T03:07:21Z","timestamp":1560049641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}