{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:53:15Z","timestamp":1725486795412},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335358"},{"type":"electronic","value":"9783642335365"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33536-5_10","type":"book-chapter","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T07:52:35Z","timestamp":1348991555000},"page":"92-94","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: Mobile Agent Rendezvous on Edge Evolving Rings"],"prefix":"10.1007","author":[{"given":"Tomoko","family":"Izumi","sequence":"first","affiliation":[]},{"given":"Yukiko","family":"Yamauchi","sequence":"additional","affiliation":[]},{"given":"Sayaka","family":"Kamei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Ferreira, A.: Building a reference combinatorial model for dynamic networks: Initial results in evolving graphs, INRIA, RR-5041 (2003)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-540-24698-5_62","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple Mobile Agent Rendezvous in a Ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 599\u2013608. Springer, Heidelberg (2004)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-642-10631-6_55","volume-title":"Algorithms and Computation","author":"P. Flocchini","year":"2009","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Exploration of Periodically Varying Graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 534\u2013543. Springer, Heidelberg (2009)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-87779-0_17","volume-title":"Distributed Computing","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic Rendezvous in Trees with Little Memory. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 242\u2013256. Springer, Heidelberg (2008)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc of ICDCS, pp. 592\u2013599 (2003)","DOI":"10.1007\/978-3-540-24698-5_62"}],"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-642-33536-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:14:34Z","timestamp":1620116074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33536-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335358","9783642335365"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33536-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}