{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:48Z","timestamp":1725564768516},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_29","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"334-345","source":"Crossref","is-referenced-by-count":1,"title":["Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs"],"prefix":"10.1007","author":[{"given":"Paul","family":"Manuel","sequence":"first","affiliation":[]},{"given":"Bharati","family":"Rajan","sequence":"additional","affiliation":[]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]},{"given":"Amutha","family":"Alaguvel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"2000","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison Wesley Longman Inc., Amsterdam (2000)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S.B. Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Computers\u00a038, 555\u2013566 (1989)","journal-title":"IEEE Trans. Computers"},{"key":"29_CR3","unstructured":"Cai, L.: Tree Spanners: Spanning trees that approximate distances, Tech. Rept. 260\/92, Dept. of Computer Science, University of Toronto"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L. Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree Spanners. SIAM J. Discrete Math.\u00a08, 359\u2013387 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01293665","volume":"14","author":"L. Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Isomorphic tree spanner problems. Algorithmica\u00a014, 138\u2013153 (1995)","journal-title":"Algorithmica"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"E. Cohen","year":"1998","unstructured":"Cohen, E.: Fast Algorithms for constructing t-spanners and paths with stretch t. SIAM J. computing\u00a028, 210\u2013236 (1998)","journal-title":"SIAM J. computing"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Kremer, J.: Tree Spanners in Planar Graphs. In: 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1998), Smolenice-Castle\/Slovakia, June 18-20 (1998)","DOI":"10.1007\/10692760_24"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-015-8937-6_5","volume-title":"Graph Symmetry","author":"M.C. Heydemann","year":"1997","unstructured":"Heydemann, M.C.: Cayley graphs and interconnection networks. In: Hahn, G., Sabidussi, G. (eds.) Graph Symmetry, pp. 167\u2013224. Kluwer Academic Publishers, The Netherlands (1997)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<257::AID-NET1>3.0.CO;2-F","volume":"27","author":"Y. Ishigami","year":"1996","unstructured":"Ishigami, Y.: The wide-diameter of the n-dimensional toroidal mesh. Networks\u00a027, 257\u2013266 (1996)","journal-title":"Networks"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S. Lakshmivarahan","year":"1993","unstructured":"Lakshmivarahan, S., Jwo, J.S., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutations groups: a survey. Parallel Computing\u00a019, 361\u2013407 (1993)","journal-title":"Parallel Computing"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/S0167-8191(99)00069-1","volume":"25","author":"S. Lakshmivarahan","year":"1999","unstructured":"Lakshmivarahan, S., Dhall, S.K.: Rings, torus, and hypercubes architectures\/algorithms for parallel computing. Parallel Computing\u00a025, 1877\u20131905 (1999)","journal-title":"Parallel Computing"},{"key":"29_CR12","volume-title":"Introduction to parallel algorithms and architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1991","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo (1991)"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<81::AID-NET1>3.0.CO;2-P","volume":"34","author":"H.-O. Le","year":"1999","unstructured":"Le, H.-O., Le, V.B.: Optimal tree 3-spanners in directed path graphs. Networks\u00a034, 81\u201397 (1999)","journal-title":"Networks"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(96)00078-6","volume":"59","author":"M.S. Madanlal","year":"1996","unstructured":"Madanlal, M.S., Venkatesan, G., Pandu Rangan, C.: Tree 3-spanners on interval, permutation and regular bipartite graphs. Information Processing Letters\u00a059, 97\u2013102 (1996)","journal-title":"Information Processing Letters"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1997.2641","volume":"136","author":"G. Venkatesan","year":"1997","unstructured":"Venkatesan, G., Rotics, U., Madanlal, M.S., Makowski, J.A., Pandu Rangan, C.: Restrictions of minimum spanner problem. Information and Computation\u00a0136, 143\u2013164 (1997)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T19:07:16Z","timestamp":1553022436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}