{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:36:42Z","timestamp":1649129802480},"reference-count":36,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00106-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"97-119","source":"Crossref","is-referenced-by-count":6,"title":["Minimum time broadcast in faulty star networks"],"prefix":"10.1016","volume":"83","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00106-6_BIB1","series-title":"Proceedings of the International Conference on Parallel Processing","first-page":"393","article-title":"The star graph: an attractive alternative to the n-cube","author":"Akers","year":"1987"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB2","series-title":"Proceedings of the 2nd Internat. Conference on Supercomputing","first-page":"270","article-title":"The fault tolerance of star graphs","author":"Akers","year":"1987"},{"issue":"7","key":"10.1016\/S0166-218X(97)00106-6_BIB3","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."},{"issue":"4","key":"10.1016\/S0166-218X(97)00106-6_BIB4","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."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0167-8191(93)90107-V","article-title":"A novel routing scheme on the star and pancake networks and its applications","volume":"19","author":"Akl","year":"1993","journal-title":"Parallel Computing"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230230403","article-title":"Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry","volume":"23","author":"Akl","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB7","series-title":"Proceedings of the 5th IEEE Symposium on Parallel and Distr. Comput.","first-page":"720","article-title":"Decomposing hierarchical cayley graphs, with applications to information dissemination and algorithm design","author":"Berthome","year":"1993"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB8","first-page":"1","article-title":"Constructing fault-tolerant minimal broadcast networks","volume":"11","author":"Chau","year":"1986","journal-title":"J. Combin. Inform. Sci."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(93)90013-Y","article-title":"Unidirectional star graphs","volume":"45","author":"Day","year":"1993","journal-title":"Inform. Processing Lett."},{"issue":"1","key":"10.1016\/S0166-218X(97)00106-6_BIB10","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 Distr. Systems"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB11","series-title":"Proceedings of the 3rd IEEE Symposium on Parallel and Distr. Comput.","first-page":"400","article-title":"Three disjoint path paradigms in star networks","author":"Dietzfelbinger","year":"1991"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB12","doi-asserted-by":"crossref","unstructured":"P. Fragopoulou, S.G. Akl, Optimal communication algorithms on stars graphs using spanning tree constructions, J. Parallel Distributed Comput., to appear.","DOI":"10.1006\/jpdc.1995.1006"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB13","unstructured":"P. Fragopoulou, S.G. Akl, Edge-disjoint spanning trees on the star network with applications to fault tolerance, Technical Report No. 93\u2013354, Department of Computing & Information Science, Queen's University, Kingston, Canada."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraignaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB15","doi-asserted-by":"crossref","DOI":"10.1002\/net.3230220505","article-title":"Tighter time bounds on fault tolerant broadcasting and gossiping","author":"Gargano","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(94)90181-3","article-title":"Reliable broadcasting","volume":"53","author":"Gargano","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/net.3230230409","article-title":"Fault-tolerant hypercube broadcasting via information dispersal","volume":"23","author":"Gargano","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB18","series-title":"CODIGRAF'93","first-page":"101","article-title":"Fault-tolerance properties of the star interconnection network","author":"Gargano","year":"1993"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB19","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":"Inform. Processing Lett."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB20","doi-asserted-by":"crossref","DOI":"10.1137\/0405015","article-title":"Minimum time broadcast networks tolerating a logarithmic number of faults","author":"Gargano","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/0167-8191(96)00023-3","article-title":"Adaptive broadcasting with faulty nodes","author":"Gasieniec","year":"1995"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB22","doi-asserted-by":"crossref","unstructured":"C. Gowrisankaran, Broadcasting in recursively decomposable Cayley graphs, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(94)90183-X"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB24","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting and gossiping)","author":"Hromkovi\u010d","year":"1995"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB25","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":"Inform. Processing Lett."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB26","first-page":"9","article-title":"An iterative sparse linear system solver on star graphs","volume":"vol. III","author":"Kim","year":"1991"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB27","series-title":"Introduction to the Theory of Finite Groups","author":"Ledermann","year":"1949"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB28","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":"Inform. Processing Lett."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB29","series-title":"Proceedings of the International Conference on Parallel Processing","first-page":"1","article-title":"An efficient sorting algorithm for the star graph interconnection network","author":"Menn","year":"1990"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB30","series-title":"Proceedings of the International Conference on Parallel Processing.","first-page":"340","article-title":"Embedding Hamiltonians and hypercubes in star interconnection graphs","author":"Nigam","year":"1990"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB31","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jpdc.1995.1054","article-title":"A note on optimal time broadcast in faulty hypercubes","volume":"26","author":"Peleg","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB32","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/net.3230190706","article-title":"Time bounds on fault-tolerant broadcasting","volume":"19","author":"Peleg","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB33","series-title":"3rd IEEE Symposium on Parallel and Distributed Computing","article-title":"Data communication and computational geometry on the star and pancake networks","author":"Qiu","year":"1991"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB34","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(91)90107-S","article-title":"Decomposing a star graph into disjoint cycles","volume":"39","author":"Qiu","year":"1991","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0166-218X(97)00106-6_BIB35","series-title":"Proceedings of 1992 International Conference on Parallel and Distributed Systems","first-page":"204","article-title":"A broadcasting algorithm in star graph interconnection networks","author":"Sheu","year":"1992"},{"key":"10.1016\/S0166-218X(97)00106-6_BIB36","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":"Comput. Math. Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:10Z","timestamp":1556666830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":36,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001066"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00106-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}