{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:35:50Z","timestamp":1769974550577,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_55","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"534-543","source":"Crossref","is-referenced-by-count":25,"title":["Exploration of Periodically Varying Graphs"],"prefix":"10.1007","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., Koucky, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Proc. 35th International Colloquium on Automata, Languages and Programming (ICALP), pp. 121\u2013132 (2008)","DOI":"10.1007\/978-3-540-70575-8_11"},{"issue":"1","key":"55_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation\u00a0176(1), 1\u201321 (2002)","journal-title":"Information and Computation"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms\u00a04(4) (2008)","DOI":"10.1145\/1383369.1383373"},{"issue":"3","key":"55_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. Graph Theory\u00a032(3), 265\u2013297 (1999)","journal-title":"J. Graph Theory"},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.tcs.2004.07.031","volume":"326","author":"A. Dessmark","year":"2004","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theoretical Computer Science\u00a0326, 343\u2013362 (2004)","journal-title":"Theoretical Computer Science"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Exploration of Periodically Varying Graphs. CoRR abs\/0909.4369, 22 pages (2009)","DOI":"10.1007\/978-3-642-10631-6_55"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Mans, B., Rodolakis, G.: Information propagation speed in mobile and delay tolerant networks. IEEE INFOCOM, 244\u2013252 (2009)","DOI":"10.1109\/INFCOM.2009.5061927"},{"issue":"9","key":"55_CR9","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TPDS.2008.218","volume":"20","author":"C. Liu","year":"2009","unstructured":"Liu, C., Wu, J.: Scalable Routing in Cyclic Mobile Networks. IEEE Transactions on Parallel and Distributed Systems\u00a020(9), 1325\u20131338 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"55_CR10","unstructured":"Shannon, C.E.: Presentation of a maze-solving machine. In: 8th Conf. of the Josiah Macy Jr. Found (Cybernetics), pp. 173\u2013180 (1951)"},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proc. ACM SIGCOMM Workshop on delay-tolerant networking, pp. 252\u2013259 (2005)","DOI":"10.1145\/1080139.1080143"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, X., Kurose, J., Levine, B.N., Towsley, D., Zhang, H.: Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing. In: Proceedings of the 13th annual ACM International Conference on Mobile Computing and Networking, pp. 195\u2013206 (2007)","DOI":"10.1145\/1287853.1287876"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:32:19Z","timestamp":1606185139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}