{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:50:20Z","timestamp":1762210220728},"reference-count":25,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0020-0255(01)00121-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:19:59Z","timestamp":1027603199000},"page":"259-276","source":"Crossref","is-referenced-by-count":43,"title":["Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security"],"prefix":"10.1016","volume":"137","author":[{"given":"A.A.","family":"Rescigno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0255(01)00121-9_BIB1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0020-0255(01)00121-9_BIB2","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/TC.1987.1676983","article-title":"On group graphs and their fault-tolerance","volume":"36","author":"Akers","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0255(01)00121-9_BIB3","unstructured":"S.B. Akers, D. Harel, B. Krishnamurty, The star graph: An attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393\u2013400"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB4","unstructured":"F. Bao, Y. Funyu, Y. Hamada, Y. Igarashi, Reliable broadcasting and secure distributing in channel networks, in: Proceedings of the Third International Symposium on Parallel Architectures, Algorithms and Networks, IEEE Computer Society, Taipei, Taiwan, December 1997, pp. 472\u2013478"},{"issue":"1","key":"10.1016\/S0020-0255(01)00121-9_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.262586","article-title":"A comparative study of topological properties of hypercubes and star graphs","volume":"5","author":"Day","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"12","key":"10.1016\/S0020-0255(01)00121-9_BIB6","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1109\/71.640011","article-title":"Nearly optimal one-to-many parallel routing in star networks","volume":"8","author":"Chen","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0020-0255(01)00121-9_BIB7","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, S. Madhavapeddy, I.H. Sudborough, Three disjoint path paradigms in star networks, in: Proceedings of the Third IEEE Symposium on Parallel and Distributed Computers, 199, pp. 400\u2013406","DOI":"10.1109\/SPDP.1991.218213"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB8","first-page":"95","article-title":"Minimum time broadcasting in the star interconnection network","volume":"82","author":"Gargano","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0255(01)00121-9_BIB9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90043-9","article-title":"Fault tolerant routing in the star and pancake interconnection networks","volume":"45","author":"Gargano","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0020-0255(01)00121-9_BIB10","first-page":"413","article-title":"Independent trees in graphs","volume":"18","author":"Huck","year":"1994","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB11","doi-asserted-by":"crossref","unstructured":"Y. Iwasaki, Y. Kajiwara, K. Obokata, Y. Igarashi, Independent spanning trees of chordal rings, in: Proceedings of the Third Annual International Computers and Combinatorics Conference in Shanghai, China, Lecture Notes in Computer Science, vol. 1276, Springer, Berlin, 1997, pp. 431\u2013440","DOI":"10.1007\/BFb0045110"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(94)90092-2","article-title":"Fault-tolerance of the star graph interconnection network","volume":"49","author":"Jovanovi\u0107","year":"1994","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0020-0255(01)00121-9_BIB13","series-title":"Introduction to the Theory of Finite Groups","author":"Ledermann","year":"1949"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","article-title":"On the fault-diameter of the star graph","volume":"46","author":"Latifi","year":"1993","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"10.1016\/S0020-0255(01)00121-9_BIB15","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/12.641935","article-title":"Fault tolerant algorithms for broadcasting on the star network","volume":"46","author":"Lo","year":"1997","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/S0020-0255(01)00121-9_BIB16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","article-title":"On sharing secrets and reed-solomon codes","volume":"24","author":"McEliece","year":"1981","journal-title":"Commun. ACM"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB17","unstructured":"M. Nigam, S. Sahani, B. Krishnamurty, Embedding hamiltonians and hypercubes in star interconnection graphs, in: Proceedings of the International Conference on Parallel Processing, 1990, pp. 340\u2013342"},{"issue":"2","key":"10.1016\/S0020-0255(01)00121-9_BIB18","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"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jpdc.1996.1297","article-title":"Selection, routing, and sorting on the star graph","volume":"41","author":"Rajasekaran","year":"1997","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"10.1016\/S0020-0255(01)00121-9_BIB20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1142\/S0129626497000085","article-title":"Fault-tolerant parallel communication in the star network","volume":"7","author":"Rescigno","year":"1997","journal-title":"Parallel Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0255(01)00121-9_BIB21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0129626498000237","article-title":"Highly fault tolerant routing in the star and hypercube interconnection networks","volume":"8","author":"Rescigno","year":"1998","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0255(01)00121-9_BIB22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/jpdc.1996.0028","article-title":"Conditional fault diameter of the star graph networks","volume":"33","author":"Rouskov","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"issue":"11","key":"10.1016\/S0020-0255(01)00121-9_BIB23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/S0020-0255(01)00121-9_BIB24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(93)90188-2","article-title":"Topological properties of the star graph","volume":"25","author":"Sur","year":"1993","journal-title":"Comp. Math. Appl."},{"issue":"12","key":"10.1016\/S0020-0255(01)00121-9_BIB25","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1109\/71.640010","article-title":"Fault-tolerant ring embedding in a star graph with both link and node failures","volume":"8","author":"Tseng","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025501001219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025501001219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:21:00Z","timestamp":1556144460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025501001219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":25,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0020025501001219"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(01)00121-9","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}