{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:30:50Z","timestamp":1733290250225,"version":"3.30.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(98)00348-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:37Z","timestamp":1027606897000},"page":"213-228","source":"Crossref","is-referenced-by-count":1,"title":["On the totalk-diameter of connection networks"],"prefix":"10.1016","volume":"247","author":[{"given":"Yefim","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"Tamar","family":"Eilam","sequence":"additional","affiliation":[]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00348-X_BIB1","unstructured":"W. Aiello, S.N. Bhatt, F.R.K. Chung, A.L. Rosenberg, R.K. Sitaraman, Augmented ring networks, typescript, Univ. Massachusetts."},{"key":"10.1016\/S0304-3975(98)00348-X_BIB2","doi-asserted-by":"crossref","unstructured":"C. Chen, J. Chen, Vertex-disjoint routing in star graphs, The 1st IEEE Internat. Conf. on Algorithms and Architecture for Parallel Processing, 1995, pp. 460\u2013464.","DOI":"10.1109\/ICAPP.1995.472218"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0304-3975(98)00348-X_BIB3"},{"key":"10.1016\/S0304-3975(98)00348-X_BIB4","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, S. Madhavapeddy, I.H. Sudborough, Three disjoint path paradigms in star networks, Proc. 3rd IEEE Symp. on Parallel and Distributed Processing, 1991, pp. 400\u2013406.","DOI":"10.1109\/SPDP.1991.218213"},{"key":"10.1016\/S0304-3975(98)00348-X_BIB5","unstructured":"Ye. Dinitz, Subset connectivity and edge-disjoint trees, with an application to target broadcasting, TR #822, Dept. of Computer Science, Technion, Haifa, Israel, 1994."},{"key":"10.1016\/S0304-3975(98)00348-X_BIB6","doi-asserted-by":"crossref","unstructured":"T. Eilam, S. Moran, S. Zaks, A Lower bound for linear Interval routing, Proc. 10th Internat. Workshop, WDAG 96, 1996, pp. 191\u2013205.","DOI":"10.1007\/3-540-61769-8_13"},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/S0304-3975(98)00348-X_BIB7"},{"key":"10.1016\/S0304-3975(98)00348-X_BIB8","doi-asserted-by":"crossref","unstructured":"J. Hastad, F.T. Leighton, M. Newman, Fast computation using fault hypercubes, Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 251\u2013263.","DOI":"10.21236\/ADA211910"},{"key":"10.1016\/S0304-3975(98)00348-X_BIB9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90036-1","article-title":"Note on the k-diameter of k-regular k-connected graphs","volume":"133","author":"Hsu","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(98)00348-X_BIB10","unstructured":"J. Jwo, S. Lakshmivarahan, S.K. Dhall, Characterizations of node disjoint (parallel) paths in star graphs, Proc. 5th Internat. Parallel Processing Symp., 1991, pp. 404\u2013409."},{"key":"10.1016\/S0304-3975(98)00348-X_BIB11","doi-asserted-by":"crossref","unstructured":"E. Kranakis, D. Krizanc, A. Pelc, Hop-congestion tradeoffs for high-speed networks, in: Proc. 7th IEEE Symp. on Parallel and Distributee Processing, pp. 662\u2013668.","DOI":"10.1109\/SPDP.1995.530745"},{"key":"10.1016\/S0304-3975(98)00348-X_BIB12","unstructured":"Q. Li, D. Sotteau, J. Xu, 2-Diameter of de-Bruijn networks, Rapport de Recherche 950, Universite de Paris Sud, Centre d'Orsay, Laboratoire de Recherche en Informatique, 91405 Orsay, France, 1995."},{"key":"10.1016\/S0304-3975(98)00348-X_BIB13","doi-asserted-by":"crossref","unstructured":"S. Madhavapeddy, I.H. Sudborough, Deterministic message routing in faulty hypercubes, Lecture Notes in Computer Science, vol. 484, Springer, Berlin, 1990, pp. 154\u2013169.","DOI":"10.1007\/3-540-53832-1_40"},{"issue":"4","key":"10.1016\/S0304-3975(98)00348-X_BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/12.2194","article-title":"Flip-trees","volume":"37","author":"Meyer","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(98)00348-X_BIB15","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1002\/net.3230190503","article-title":"Message complexity versus space complexity in fault tolerant broadcast protocols","volume":"19","author":"Moran","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(98)00348-X_BIB16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","article-title":"Efficient dispersal of information for security, load balancing, and fault tolerance","volume":"36","author":"Rabin","year":"1989","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800348X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800348X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T02:25:15Z","timestamp":1733279115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800348X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S030439759800348X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00348-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}