{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:53Z","timestamp":1725664793564},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616481"},{"type":"electronic","value":"9783540706533"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61648-9_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:09:51Z","timestamp":1330294191000},"page":"298-305","source":"Crossref","is-referenced-by-count":1,"title":["Efficient broadcasting on faulty star networks"],"prefix":"10.1007","author":[{"given":"Aohan","family":"Mei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihide","family":"Igarashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Shimizu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"17_CR1","unstructured":"S. B. Akers, D. Harel, and B. Krishnamurthy, \u201cThe star graph: An attractive alternative to the n-cube.\u201d In Proc. Int. Conf. Parallel Processing, pp. 393\u2013400, 1987."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/TC.1987.1676983","volume":"C-36","author":"S. B. Akers","year":"1987","unstructured":"S. B. Akers and B. Krishnamurthy, \u201cOn group graphs and their fault tolerance.\u201d IEEE Trans. Computers, Vol. C-36, pp. 885\u2013888, 1987.","journal-title":"IEEE Trans. Computers"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy, \u201cA group-theoretic model for symmetric interconnection networks.\u201d IEEE Trans. Computers, Vol. 38, pp. 555\u2013566, 1989.","journal-title":"IEEE Trans. Computers"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1109\/12.247843","volume":"42","author":"N. Bagherzadeh","year":"1993","unstructured":"N. Bagherzadeh, N. Nassif, and S. Latifi, \u201cA routing and broadcasting scheme on faulty star graphs.\u201d IEEE Trans. Computers, Vol. 42, pp. 1398\u20131403, 1993.","journal-title":"IEEE Trans. Computers"},{"key":"17_CR5","first-page":"255","volume":"E75-A","author":"S. Carlsson","year":"1992","unstructured":"S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura, and O. Petersson, \u201cInformation disseminating schemes for fault tolerance in hypercubes.\u201d IEICE Trans. Fundamentals, Vol. E75-A, pp. 255\u2013260, 1992.","journal-title":"IEICE Trans. Fundamentals"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.262586","volume":"5","author":"K. Day","year":"1994","unstructured":"K. Day and A. Tripathi, \u201cA comparative study of topological properties of hypercubes and star graphs.\u201d IEEE Trans. Parallel and Distributed Systems, Vol. 5, pp. 31\u201338, 1994.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jpdc.1995.1006","volume":"24","author":"P. Fragopoulou","year":"1995","unstructured":"P. Fragopoulou and S. G. Akl, \u201cOptimal communication algorithms on star graphs using spanning tree constructions.\u201d Journal of Parallel and Distributed Computing, Vol. 24, pp. 55\u201371, 1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"17_CR8","unstructured":"L. Gargano, A. A. Rescigno, and U. Vaccaro, \u201cOptimal communication in faulty star networks.\u201d Manuscript, 1995."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1988","unstructured":"S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, \u201cA survey of gossiping and broadcasting in communication networks.\u201d Networks, Vol. 18, pp. 319\u2013349, 1988.","journal-title":"Networks"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"A. Mei, F. Bao, Y. Hamada, and Y. Igarashi, \u201cOptimal time broadcasting in faulty star networks.\u201d In Proc. 10th International Workshop on Distributed Algorithms, 1996, to appear.","DOI":"10.1007\/3-540-61769-8_12"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/71.149958","volume":"3","author":"V. E. Mendia","year":"1992","unstructured":"V. E. Mendia and D. Sarkar, \u201cOptimal broadcasting on the star graph.\u201d IEEE Trans. Parallel and Distributed Systems, Vol. 3, pp. 389\u2013396, 1992.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"A. Pelc, \u201cFault-tolerant broadcasting and gossiping in communication networks.\u201d Manuscript, 1995.","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jpdc.1995.1054","volume":"26","author":"D. Peleg","year":"1995","unstructured":"D. Peleg, \u201cA note on optimal time broadcast in faulty hypercubes.\u201d Journal of Parallel and Distributed Computing, Vol. 26, pp. 132\u2013135, 1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/12.9743","volume":"37","author":"P. Ramanathan","year":"1988","unstructured":"P. Ramanathan and K. G. Shin, \u201cReliable broadcast in hypercube multicomputers.\u201d IEEE Trans. Computers, Vol. 37, pp. 1654\u20131657, 1988.","journal-title":"IEEE Trans. Computers"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(93)90087-P","volume":"48","author":"Y. Rouskov","year":"1993","unstructured":"Y. Rouskov and P. K. Srimani, \u201cFault diameter of star graphs.\u201d Information Processing Letters, Vol. 48, pp. 243\u2013251, 1993.","journal-title":"Information Processing Letters"},{"key":"17_CR16","first-page":"267","volume":"III","author":"S. Sur","year":"1991","unstructured":"S. Sur and P. K. Srimani, \u201cA fault tolerant routing algorithm in star graph interconnection networks.\u201d In Proc. Int. Conf. Parallel Processing, Vol. III, pp. 267\u2013270, 1991.","journal-title":"Proc. Int. Conf. Parallel Processing"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques in Real-Time and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61648-9_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:03Z","timestamp":1605647343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61648-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616481","9783540706533"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61648-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}