{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:23:28Z","timestamp":1648902208701},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0020-0190(94)90092-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"145-150","source":"Crossref","is-referenced-by-count":27,"title":["Fault tolerance of the star graph interconnection network"],"prefix":"10.1016","volume":"49","author":[{"given":"Zoran","family":"Jovanovi\u0107","sequence":"first","affiliation":[]},{"given":"Jelena","family":"Mi\u0161i\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90092-2_BIB1","first-page":"393","article-title":"The star graph: An attractive alternative to the n-cube","author":"Akers","year":"1987","journal-title":"Proc. 1987 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(94)90092-2_BIB2","first-page":"270","article-title":"The fault tolerance of star graphs","volume":"Vol. III","author":"Akers","year":"1987","journal-title":"Proc. Second Internat. Conf. on Supercomputing"},{"issue":"4","key":"10.1016\/0020-0190(94)90092-2_BIB3","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\/0020-0190(94)90092-2_BIB4","series-title":"Tech. Rept. TI-ETF-RTI-92-007","article-title":"Routing function and deadlock avoidance in a star graph interconnection network","author":"Mis\u0306i\u0107","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:29:20Z","timestamp":1555129760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0020019094900922"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90092-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}