{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:08:01Z","timestamp":1742951281285,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"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-22212-2_19","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T03:22:50Z","timestamp":1311218570000},"page":"210-221","source":"Crossref","is-referenced-by-count":2,"title":["The Cover Times of Random Walks on Hypergraphs"],"prefix":"10.1007","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs, \n                    \n                      http:\/\/stat-www.berkeley.edu\/pub\/users\/aldous\/RWG\/book.html"},{"key":"19_CR2","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: Proc. 20th Annual IEEE Symp. Foundations of Computer Science, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Avin, C., Lando, Y., Lotker, Z.: Radio cover time in hyper-graphs. In: Proc. DIALM-POMC, Joint Workshop on Foundations of Mobile Computing, pp. 3\u201312 (2010)","DOI":"10.1145\/1860684.1860689"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B. Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal on Combinatorics\u00a01, 311\u2013316 (1980)","journal-title":"European Journal on Combinatorics"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Cong, J., Hagen, L., Kahng, A.: Random walks for circuit clustering. In: Proc. 4th IEEE Intl. ASIC Conf., pp. 14.2.1\u201314.2.4 (1991)","DOI":"10.1109\/ASIC.1991.242897"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1137\/S0895480103428478","volume":"18","author":"C. Cooper","year":"2005","unstructured":"Cooper, C., Frieze, A.M.: The cover time of random regular graphs. SIAM Journal on Discrete Mathematics\u00a018, 728\u2013740 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1002\/rsa.20201","volume":"32","author":"C. Cooper","year":"2008","unstructured":"Cooper, C., Frieze, A.M.: The cover time of the giant component of of G\n                  \n                    n,p\n                  . Random Structures and Algorithms\u00a032, 401\u2013439 (2008)","journal-title":"Random Structures and Algorithms"},{"key":"19_CR8","volume-title":"An Introduction to Probability Theory","author":"W. Feller","year":"1960","unstructured":"Feller, W.: An Introduction to Probability Theory, 2nd edn., vol.\u00a0I. Wiley, Chichester (1960)","edition":"2"},{"key":"19_CR9","first-page":"353","volume":"2","author":"L. Lov\u00e1sz","year":"1996","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey. Bolyai Society Mathematical Studies\u00a02, 353\u2013397 (1996)","journal-title":"Bolyai Society Mathematical Studies"},{"issue":"1","key":"19_CR10","first-page":"189","volume":"16","author":"P. Matthews","year":"1988","unstructured":"Matthews, P.: Covering Problems for Brownian Motion on Spheres. Annals of Probability, Institute of Mathematical Statistics\u00a016(1), 189\u2013199 (1988)","journal-title":"Annals of Probability, Institute of Mathematical Statistics"},{"key":"19_CR11","first-page":"1601","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"D. Zhou","year":"2007","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with Hypergraphs: Clustering, Classifcation, and Embedding. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a019, pp. 1601\u20131608. MIT Press, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T09:42:18Z","timestamp":1553938938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}