{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:29Z","timestamp":1725664049106},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:57:33Z","timestamp":1330253853000},"page":"126-134","source":"Crossref","is-referenced-by-count":0,"title":["Graph spanners and connectivity"],"prefix":"10.1007","author":[{"given":"Shuichi","family":"Ueno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michihiro","family":"Yamazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoji","family":"Kajitani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF02187901","volume":"3","author":"I. Alth\u00f6fer","year":"1988","unstructured":"I. Alth\u00f6fer. On optimal realizations of finite metric spaces by graphs. Discrete and Computational Geometry, 3:103\u2013122, 1988.","journal-title":"Discrete and Computational Geometry"},{"key":"14_CR2","first-page":"26","volume":"447","author":"I. Alth\u00f6fer","year":"1990","unstructured":"I. Alth\u00f6fer, G. Das, D. Dobkin, and D. Joseph. Generating sparse spanners for weighted graphs. In LNCS 447, pages 26\u201337, 1990.","journal-title":"LNCS"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch. Complexity of network synchronization. J. ACM, 32:804\u2013823, 1985.","journal-title":"J. ACM"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. In STOC, pages 479\u2013489, 1989.","DOI":"10.1145\/73007.73053"},{"key":"14_CR5","first-page":"369","volume":"319","author":"B. Awerbuch","year":"1988","unstructured":"B. Awerbuch, O. Goldreich, D. Peleg, and R. Vainish. A tradeoff between information and communication in broadcast protocols. In LNCS 319, pages 369\u2013379, 1988.","journal-title":"LNCS"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and D. Peleg. Sparse partitions. In FOCS, pages 503\u2013513, 1990.","DOI":"10.1109\/FSCS.1990.89571"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","volume":"7","author":"Bandelt","year":"1986","unstructured":"Bandelt and Dress. Reconstructing the shape of a tree from observed dissimilarity data. Advances in Appl. Maths., 7:309\u2013343, 1986.","journal-title":"Advances in Appl. Maths."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s. Extremal Graph Theory. Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L. P. Chew","year":"1989","unstructured":"L. P. Chew. There are planar graphs almost as good as the complete graph. J. Comput. System Sci., 39:205\u2013219, 1989.","journal-title":"J. Comput. System Sci."},{"key":"14_CR10","first-page":"168","volume":"401","author":"G. Das","year":"1989","unstructured":"G. Das and D. Joseph. Which triangulations approximate the complete graph? In LNCS 401, pages 168\u2013192, 1989.","journal-title":"LNCS"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. In FOCS, pages 20\u201326, 1987.","DOI":"10.1109\/SFCS.1987.18"},{"key":"14_CR12","first-page":"208","volume":"318","author":"J. M. Keil","year":"1988","unstructured":"J. M. Keil. Approximating the complete euclidean graph. In LNCS 318, pages 208\u2013213, 1988.","journal-title":"LNCS"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J. M. Keil","year":"1992","unstructured":"J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete euclidean graph. Discrete Comput. Geom., 7:13\u201328, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"14_CR14","first-page":"9","volume":"401","author":"C. Levcopoulos","year":"1989","unstructured":"C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees. In LNCS 401, pages 9\u201313, 1989.","journal-title":"LNCS"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF02993903","volume":"37","author":"W. Mader","year":"1972","unstructured":"W. Mader. Existenz n-fachen zusammenh\u00c4ngenden teilgraphen in graphen gen\u00fcgend grosser kantendichte. Abh. Math. Sem. Univ. Hamburg, 37:86\u201397, 1972.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and A. A. Sch\u00c4ffer. Graph spanners. J. Graph Theory, 13:99\u2013116, 1989.","journal-title":"J. Graph Theory"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM J. Comput., 18:740\u2013747, 1989.","journal-title":"SIAM J. Comput."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"D. Peleg and E. Upfal. A tradeoff between space and efficiency for routing tables. In STOC, pages 43\u201352, 1988.","DOI":"10.1145\/62212.62217"},{"key":"14_CR19","unstructured":"C. Thomassen. Paths, cycles and subdivisions. In L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory III, Academic Press, 1988."},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02574695","volume":"6","author":"P. M. Vaidya","year":"1991","unstructured":"P. M. Vaidya. A sparse graph almost as good as the complete graph on points in k dimensions. Discrete Comput. Geom., 6:369\u2013381, 1991.","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:59Z","timestamp":1605646979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}