{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:17:47Z","timestamp":1725869867414},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319492582"},{"type":"electronic","value":"9783319492599"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-49259-9_20","type":"book-chapter","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T21:11:34Z","timestamp":1478034694000},"page":"248-262","source":"Crossref","is-referenced-by-count":1,"title":["Self-stabilizing Metric Graphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gmyr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"Lef\u00e8vre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-57529-4_72","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"S Aggarwal","year":"1993","unstructured":"Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithms. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 400\u2013410. Springer, Heidelberg (1993). doi: 10.1007\/3-540-57529-4_72"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-24550-3_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Berns","year":"2011","unstructured":"Berns, A., Ghosh, S., Pemmaraju, S.V.: Building self-stabilizing overlay networks with the transitive closure framework. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 62\u201376. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24550-3_7"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2011.12.079","volume":"428","author":"T Clouser","year":"2012","unstructured":"Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: a self-stabilizing deterministic skip list and skip graph. Theor. Comput. Sci. 428, 18\u201335 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR4","unstructured":"Cramer, C., Fuhrmann, T., Informatik, F.F.: Self-stabilizing ring networks on connected graphs. Technical report (2005)"},{"key":"20_CR5","unstructured":"G\u00e4rtner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report (2003)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 131\u2013140. ACM (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-51542-9_6","volume-title":"Algorithms and Data Structures","author":"JM Keil","year":"1989","unstructured":"Keil, J.M., Gutwin, C.A.: The Delaunay triangulation closely approximates the complete Euclidean graph. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1989. LNCS, vol. 382, pp. 47\u201356. Springer, Heidelberg (1989). doi: 10.1007\/3-540-51542-9_6"},{"issue":"1","key":"20_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete euclidean graph. Discrete Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"20_CR9","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s00224-012-9431-2","volume":"55","author":"S Kniesburges","year":"2014","unstructured":"Kniesburges, S., Koutsopoulos, A., Scheideler, C.: Re-chord: a self-stabilizing chord overlay network. Theory Comput. Syst. 55(3), 591\u2013612 (2014)","journal-title":"Theory Comput. Syst."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Onus, M., Richa, A.W., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.10"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-24550-3_31","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Richa","year":"2011","unstructured":"Richa, A., Scheideler, C., Stevens, P.: Self-stabilizing de bruijn networks. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 416\u2013430. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24550-3_31"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology p2p systems. In: Fifth IEEE International Conference on Peer-to-Peer Computing, P2P, pp. 39\u201346 (2005)","DOI":"10.1109\/P2P.2005.34"}],"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-49259-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T02:09:22Z","timestamp":1568513362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49259-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319492582","9783319492599"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49259-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}