{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:49Z","timestamp":1725490249660},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742074"},{"type":"electronic","value":"9783540742081"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_31","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T10:52:26Z","timestamp":1188211946000},"page":"422-435","source":"Crossref","is-referenced-by-count":2,"title":["The Cover Time of Random Digraphs"],"prefix":"10.1007","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_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":"31_CR2","first-page":"218","volume-title":"Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science","author":"R. Aleliunas","year":"1979","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. IEEE Computer Society Press, Los Alamitos (1979)"},{"key":"31_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley-Interscience, Chichester (2000)","edition":"2"},{"key":"31_CR4","unstructured":"Cooper, C., Frieze, A.M.: The cover time of sparse random graphs. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 140\u2013147 (2003)"},{"key":"31_CR5","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":"31_CR6","doi-asserted-by":"crossref","unstructured":"Cooper, C., Frieze, A.M.: The cover time of the preferential attachment graph. Journal of Combinatorial Theory Series B\u00a0(to appear)","DOI":"10.1016\/j.jctb.2006.05.007"},{"key":"31_CR7","unstructured":"Cooper, C., Frieze, A.M.: The cover time of the giant component of a random graph"},{"key":"31_CR8","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":"31_CR9","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":"31_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058, 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s004930070014","volume":"20","author":"J.H. Kim","year":"2000","unstructured":"Kim, J.H., Vu, V.: Concentration of multivariate polynomials and its applications. Combinatorica\u00a020, 417\u2013434 (2000)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74208-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T21:56:06Z","timestamp":1550872566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74208-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}