{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:30Z","timestamp":1725488490077},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638759"},{"type":"electronic","value":"9783540696582"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63875-x_61","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T07:08:01Z","timestamp":1186470481000},"page":"312-320","source":"Crossref","is-referenced-by-count":0,"title":["A fault tolerant broadcast scheme in star graphs"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,8,1]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38(4):555\u2013566, April 1989.","journal-title":"IEEE Trans. Comput."},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230230403","volume":"23","author":"S. G. Akl","year":"1993","unstructured":"S. G. Akl and K. Qiu. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks, 23:215\u2013225,1993.","journal-title":"Networks"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0167-8191(93)90107-V","volume":"19","author":"S. G. Akl","year":"1993","unstructured":"S. G. Akl and K. Qiu. A novel routing scheme on the star and pancake networks and its applications. Parallel Computing, 19:95\u2013101, 1993.","journal-title":"Parallel Computing"},{"issue":"11","key":"24_CR4","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/12.247843","volume":"42","author":"N. Bagherzadeh","year":"1993","unstructured":"N. Bagherzadeh, N. Nassif, and S. Latifi. A routing and broadcasting scheme on faulty star graphs. IEEE Trans. Comput., 42(11):1398\u20131403, November 1993.","journal-title":"IEEE Trans. Comput."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/jpdc.1995.1006","volume":"24","author":"P. Fragopoulou","year":"1995","unstructured":"P. Fragopoulou and S. G. Akl. Optimal communication algorithms on star graphs using spanning tree constructions. Journal of Parallel and Distributed Computing, 24:55\u201371,1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.485370","volume":"45","author":"P. Fragopoulou","year":"1996","unstructured":"P. Fragopoulou and S. G. Akl. Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans. Comput., 45(2):174\u2013185, February 1996.","journal-title":"IEEE Trans. Comput."},{"key":"24_CR7","first-page":"47","volume":"COMP96-27","author":"Y. Hamada","year":"1996","unstructured":"Y. Hamada, A. Mei, F. Bao, and Y. Igarashi. Broadcasting in star graphs with byzantine failures. Technical Report of IEICE, COMP96-27:47\u201356, July 1996.","journal-title":"Technical Report of IEICE"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","volume":"46","author":"S. Latifi","year":"1993","unstructured":"S. Latifi. On the fault-diameter of the star graph. Inform. Process. Lett., 46:143\u2013150, June 1993.","journal-title":"Inform. Process. Lett."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0020-0190(93)90043-9","volume":"45","author":"L. Gargano","year":"1993","unstructured":"L.Gargano, U. Vaccaro, and A. Vozella. Fault tolerant routing in the star and pancake interconnection networks. Inform. Process. Lett., 45:315\u2013320, April 1993.","journal-title":"Inform. Process. Lett."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"A. Mei, F. Bao, Y. Hamada, and Y. Igarashi. Optimal time broadcasting in faulty star networks. In Proc. WDAG'96, LNCS 1151, pp.175\u2013190, 1996.","DOI":"10.1007\/3-540-61769-8_12"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/71.149958","volume":"3","author":"V. E. Mendia","year":"1992","unstructured":"V. E. Mendia and D. Sarkar. Optimal broadcasting in the star graph. IEEE Trans. Parallel and Distributed Systems, 3:389\u2013396, July 1992.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/net.3230220503","volume":"22","author":"A. Pelc","year":"1992","unstructured":"A. Pelc. Reliable communication in networks with Byzantine link failures. Networks, 22:441\u2013459, 1992.","journal-title":"Networks"},{"key":"24_CR13","doi-asserted-by":"publisher","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. Fault diameter of star graphs. Inform. Process. Lett., 48:243\u2013251, 1993.","journal-title":"Inform. Process. Lett."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0020-0190(93)90086-O","volume":"48","author":"J.-P. Sheu","year":"1993","unstructured":"J.-P. Sheu, C.-T. Liaw, and T.-S. Chen. A broadcasting algorithm in star graph interconnection networks. Inform. Process. Lett., 48:237\u2013241, 1993.","journal-title":"Inform. Process. Lett."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"J. P. Sheu, C.-T. Liaw, and T.-S. Chen. An optimal broadcasting algorithm without message redundancy in star graphs. IEEE Trans. Parallel and Distributed Systems, 6(6), June 1995.","DOI":"10.1109\/71.388046"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN'97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63875-X_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:10:33Z","timestamp":1556741433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63875-X_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638759","9783540696582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-63875-x_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}