{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:17:00Z","timestamp":1725556620066},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_13","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T22:20:16Z","timestamp":1274826016000},"page":"131-135","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Circuit\u2013Switched Broadcasting in Star Graph"],"prefix":"10.1007","author":[{"given":"Cheng-Ta","family":"Lee","sequence":"first","affiliation":[]},{"given":"Yeong-Sung","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Akers, S.B., Harel, D., Krishnameurthy, B.: The star graph: an attractive alternative to the n-cube. In: International Conference on Parallel Processing, pp. 393\u2013400 (1987)"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S.B. Akers","year":"1989","unstructured":"Akers, S.B., Krishnameurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers\u00a038(4), 555\u2013566 (1989)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/71.262586","volume":"5","author":"K. Day","year":"1994","unstructured":"Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems\u00a05(1), 31\u201338 (1994)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Qiu, K.: On some properties and algorithms for the star and pancake interconnection network. Journal of Parallel and Distributed Computing, 16\u201325 (1994)","DOI":"10.1006\/jpdc.1994.1066"},{"key":"13_CR5","unstructured":"Jwo, J.S., Lakshmivarahan, S., Dhall, S.K.: Embeddings of cycles and grids in star graphs. In: IEEE International Symposium on Parallel and Distributed Processing, pp. 540\u2013547 (1990)"},{"key":"13_CR6","unstructured":"Nigam, M., Sahni, S., Krishnamurthy, B.: Embedding hamiltonians and hypercubes in star interconnection graphs. In: International Conference on Parallel processing, vol.\u00a03, pp. 340\u2013343 (1990)"},{"issue":"11","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/12.247843","volume":"42","author":"N. Bagherzadeh","year":"1993","unstructured":"Bagherzadeh, N., Nassif, N., Latifi, S.: A routing and broadcasting scheme on faulty star graphs. IEEE Transactions on Computers\u00a042(11), 1398\u20131403 (1993)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0190(94)90092-2","volume":"49","author":"Z. Jovanovic","year":"1994","unstructured":"Jovanovic, Z., Mi\u0161ic, J.: Fault tolerance of the star graph interconnection network. Information Processing Letters\u00a049(3), 145\u2013150 (1994)","journal-title":"Information Processing Letters"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","volume":"46","author":"S. Latifi","year":"1993","unstructured":"Latifi, S.: On the fault-diameter of the star graph. Information Processing Letters\u00a046(3), 143\u2013150 (1993)","journal-title":"Information Processing Letters"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/71.262593","volume":"5","author":"S. latifi","year":"1994","unstructured":"latifi, S., Bagherzadeh, N.: Incomplete star: an incrementally scalable network based on the star graph. IEEE Transactions on Parallel and Distributed Systems\u00a05(1), 97\u2013102 (1994)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"13_CR11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedtniemi","year":"1988","unstructured":"Hedtniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. IEEE Networks\u00a018(4), 319\u2013349 (1988)","journal-title":"IEEE Networks"},{"issue":"1-3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics\u00a053(1-3), 79\u2013133 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:58Z","timestamp":1606186918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}