{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:37:32Z","timestamp":1649212652814},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0164-1212(01)00121-2","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:14:48Z","timestamp":1034021688000},"page":"151-158","source":"Crossref","is-referenced-by-count":0,"title":["On the attractiveness of the star network"],"prefix":"10.1016","volume":"63","author":[{"given":"Abdel-Elah","family":"Al-Ayyoub","sequence":"first","affiliation":[]},{"given":"Khaled","family":"Day","sequence":"additional","affiliation":[]},{"given":"Abdullah","family":"Al-Dhelaan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(01)00121-2_BIB1","series-title":"Proceedings of the 2nd International Conference on Supercomputing","first-page":"270","article-title":"The fault tolerance of star graphs","author":"Akers","year":"1987"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB2","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"},{"issue":"8","key":"10.1016\/S0164-1212(01)00121-2_BIB3","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/71.605767","article-title":"Matrix decomposition on the star graph","volume":"8","author":"Al-Ayyoub","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"10.1016\/S0164-1212(01)00121-2_BIB4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/jpdc.1997.1414","article-title":"The hyperstar interconnection networks","volume":"48","author":"Al-Ayyoub","year":"1998","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB5","unstructured":"Al-Dhelaan, A., Al-Kahtani, A., 1993. Star connected cycles network, MS Proposal, King Saud University Saudi Arabia"},{"issue":"12","key":"10.1016\/S0164-1212(01)00121-2_BIB6","doi-asserted-by":"crossref","first-page":"1292","DOI":"10.1109\/71.553290","article-title":"Optimal information dissemination in star and pancake networks","volume":"7","author":"Berthome","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"10.1016\/S0164-1212(01)00121-2_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/71.577251","article-title":"The cross product of interconnection networks","volume":"8","author":"Day","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"10.1016\/S0164-1212(01)00121-2_BIB8","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 Transactions on Parallel and Distributed Systems"},{"issue":"5","key":"10.1016\/S0164-1212(01)00121-2_BIB9","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/71.282562","article-title":"A parallel algorithm for computing fourier transforms on the star graph","volume":"5","author":"Fragopoulou","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"6","key":"10.1016\/S0164-1212(01)00121-2_BIB10","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/12.277296","article-title":"The cost of broadcasting on star graphs and k-ary hypercubes","volume":"42","author":"Graham","year":"1993","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"10.1016\/S0164-1212(01)00121-2_BIB11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/S0218126691000215","article-title":"Embedding of cycles and grids in star graphs","volume":"1","author":"Jwo","year":"1991","journal-title":"Journal of Circuits, Systems, and Computers"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB12","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":"Information Processing Letters"},{"issue":"1","key":"10.1016\/S0164-1212(01)00121-2_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/71.262593","article-title":"Incomplete star: an incrementally scalable network based on the star graph","volume":"5","author":"Latifi","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB14","first-page":"1","article-title":"An efficient sorting algorithm for the star graph interconnection network","volume":"3","author":"Menn","year":"1990","journal-title":"1990 International Conference on Parallel Processing"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB15","first-page":"340","article-title":"Embedding hamiltonians and hypercubes in star interconnection graphs","author":"Nigam","year":"1990","journal-title":"Proceedings of the International Conference on Parallel Processing"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB16","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":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"10.1016\/S0164-1212(01)00121-2_BIB17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jpdc.1993.1098","article-title":"Embedding meshes on the star graph","volume":"19","author":"Ranka","year":"1993","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0164-1212(01)00121-2_BIB18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(93)90087-P","article-title":"Fault diameter of star graphs","volume":"48","author":"Rouskov","year":"1993","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/S0164-1212(01)00121-2_BIB19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/71.494627","article-title":"Two ranking schemes for efficient computation on the star interconnection network","volume":"7","author":"Saika","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Computing"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121201001212?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121201001212?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T14:25:17Z","timestamp":1556202317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121201001212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0164121201001212"],"URL":"http:\/\/dx.doi.org\/10.1016\/s0164-1212(01)00121-2","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}
