{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:43:47Z","timestamp":1742993027987,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_33","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T23:30:06Z","timestamp":1507246206000},"page":"441-455","source":"Crossref","is-referenced-by-count":0,"title":["Cover Time in Edge-Uniform Stochastically-Evolving Graphs"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Lamprou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences and the complexity of maze problems. In: 20th IEEE Annual Symposium on Foundations of Computer Science, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 121\u2013132. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-70575-8_11"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-51687-5_27","volume-title":"Distributed Algorithms","author":"J Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Zernik, D.: Random leaders and random spanning trees. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 1\u201312. Springer, Heidelberg (1989). doi:\n10.1007\/3-540-51687-5_27"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proceedings of 28th ACM Symposium on Principles of Distributed Computing (PODC 2009), pp. 260\u2013269. ACM (2009)","DOI":"10.1145\/1582716.1582757"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11553762_1","volume-title":"Innovative Internet Community Systems","author":"M Bui","year":"2006","unstructured":"Bui, M., Bernard, T., Sohier, D., Bui, A.: Random walks in distributed computing: a survey. In: B\u00f6hme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds.) IICS 2004. LNCS, vol. 3473, pp. 1\u201314. Springer, Heidelberg (2006). doi:\n10.1007\/11553762_1"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R.: The electrical resistance of a graph captures its commute and cover times. In: Proceedings of 21t Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 574\u2013586. ACM (1989)","DOI":"10.1145\/73007.73062"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-Markovian dynamic graphs. In: PODC 2008, pp. 213\u2013222. ACM (2008)","DOI":"10.1145\/1400751.1400781"},{"issue":"9","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TPDS.2011.33","volume":"22","author":"A Clementi","year":"2011","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary Markovian evolving graphs. IEEE Trans. Parallel Distrib. Syst. 22(9), 1425\u20131432 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Communication in dynamic radio networks. In: PODC 2007, pp. 205\u2013214. ACM (2007)","DOI":"10.1145\/1281100.1281131"},{"key":"33_CR10","unstructured":"Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks (2006)"},{"key":"33_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"M Habib","year":"1998","unstructured":"Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B.: Probabilistic Methods for Algorithmic Discrete Mathematics. Springer, Heidelberg (1998)"},{"key":"33_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36461-7_15","volume-title":"Temporal Networks","author":"T Hoffmann","year":"2013","unstructured":"Hoffmann, T., Porter, M.A., Lambiotte, R.: Random walks on stochastic temporal networks. In: Holme, P., Saram\u00e4ki, J. (eds.) Temporal Networks. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-36461-7_15"},{"issue":"4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"key":"33_CR14","volume-title":"Markov Chains","author":"JR Norris","year":"1998","unstructured":"Norris, J.R.: Markov Chains. Cambridge University Press, Cambridge (1998)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Ramiro, V., Lochin, E., Snac, P., Rakotoarivelo, T.: Temporal random walk as a lightweight communication infrastructure for opportunistic networks. In: Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1\u20136 (2014)","DOI":"10.1109\/WoWMoM.2014.6918919"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"056115","DOI":"10.1103\/PhysRevE.85.056115","volume":"85","author":"M Starnini","year":"2012","unstructured":"Starnini, M., Baronchelli, A., Barrat, A., Pastor-Satorras, R.: Random walks on temporal networks. Phys. Rev. E 85, 056115 (2012)","journal-title":"Phys. Rev. E"},{"key":"33_CR17","volume-title":"Sequential Analysis","author":"A Wald","year":"1947","unstructured":"Wald, A.: Sequential Analysis. Wiley, New York (1947)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Yamauchi, Y., Izumi, T., Kamei, S.: Mobile agent rendezvous on a probabilistic edge evolving ring. In: Proceedings of 3rd International Conference on Networking and Computing (ICNC 2012), pp. 103\u2013112 (2012)","DOI":"10.1109\/ICNC.2012.23"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T08:25:07Z","timestamp":1531297507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}