{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:37Z","timestamp":1740109417368,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["SFB 901\/2 2016"],"award-info":[{"award-number":["SFB 901\/2 2016"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"name":"EU FET Proactive ICT","award":["317532"],"award-info":[{"award-number":["317532"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00224-017-9823-4","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T01:46:40Z","timestamp":1510883200000},"page":"177-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Self-Stabilizing Metric Graphs"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2242-6083","authenticated-orcid":false,"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":[[2017,11,17]]},"reference":[{"key":"9823_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithms. In: Foundations of Software Technology and Theoretical Computer Science, pp 400\u2013410. Springer (1993)","DOI":"10.1007\/3-540-57529-4_72"},{"key":"9823_CR2","doi-asserted-by":"crossref","unstructured":"Berns, A., Ghosh, S., Pemmaraju, S.V.: Building self-stabilizing overlay networks with the transitive closure framework. In: Proceedings of the 13Th International Conference on Stabilization, Safety, and Security of Distributed Systems, SSS\u201911, pp 62\u201376. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-24550-3_7"},{"key":"9823_CR3","doi-asserted-by":"publisher","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":"9823_CR4","unstructured":"Cramer, C., Fuhrmann, T., Fakult\u00e4t F\u00fcr Informatik: Self-stabilizing ring networks on connected graphs. Technical report (2005)"},{"key":"9823_CR5","unstructured":"G\u00e4rtner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report (2003)"},{"key":"9823_CR6","unstructured":"Gmyr, R., Lef\u00e8vre, J., Scheideler, C.: Self-stabilizing metric graphs. In: Stabilization, Safety, and Security of Distributed Systems - 18Th International Symposium, SSS 2016, Lyon, France, November 7\u201310, 2016, Proceedings, pp 248\u2013262 (2016)"},{"key":"9823_CR7","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":"9823_CR8","doi-asserted-by":"crossref","unstructured":"Keil, J.M., Gutwin, C.A.: The delaunay triangulation closely approximates the complete euclidean graph. In: Algorithms and Data Structures, pp 47\u201356. Springer (1989)","DOI":"10.1007\/3-540-51542-9_6"},{"issue":"1","key":"9823_CR9","doi-asserted-by":"publisher","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":"9823_CR10","doi-asserted-by":"publisher","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":"9823_CR11","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":"9823_CR12","doi-asserted-by":"crossref","unstructured":"Richa, A., Scheideler, C., Stevens, P.: Self-stabilizing De Bruijn networks. In: Stabilization, Safety, and Security of Distributed Systems, pp 416\u2013430. Springer (2011)","DOI":"10.1007\/978-3-642-24550-3_31"},{"key":"9823_CR13","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, 2005. P2P 2005, pp 39\u201346 (2005)","DOI":"10.1109\/P2P.2005.34"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9823-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9823-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9823-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T04:10:58Z","timestamp":1570335058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9823-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["9823"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9823-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,11,17]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}