{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:51Z","timestamp":1757629551703,"version":"3.44.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1988,8]]},"DOI":"10.1016\/0743-7315(88)90004-4","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"383-403","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Uniform minimal full-access networks"],"prefix":"10.1016","volume":"5","author":[{"given":"M.A.","family":"Sridhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.S.","family":"Raghavendra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(88)90004-4_BIB1","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TC.1983.1676295","article-title":"Graph-theoretical analysis and design of multistage interconnection networks","volume":"C-32","author":"Agrawal","year":"1983","journal-title":"IEEE Trans. Comput."},{"year":"1974","series-title":"Algebraic Graph Theory","author":"Biggs","key":"10.1016\/0743-7315(88)90004-4_BIB2"},{"year":"1986","series-title":"Graphs and Digraphs","author":"Chartrand","key":"10.1016\/0743-7315(88)90004-4_BIB3"},{"key":"10.1016\/0743-7315(88)90004-4_BIB4","series-title":"Proc. First Ann. Symp. Computer Architecture","first-page":"21","article-title":"Banyan networks for partitioning multiprocessor systems","author":"Goke","year":"1973"},{"year":"1967","series-title":"Shift-Register Sequences","author":"Golomb","key":"10.1016\/0743-7315(88)90004-4_BIB5"},{"key":"10.1016\/0743-7315(88)90004-4_BIB6","series-title":"Selected Topics in Graph Theory","article-title":"Line graphs and line digraphs","author":"Hemminger","year":"1978"},{"key":"10.1016\/0743-7315(88)90004-4_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0095-8956(78)90052-7","article-title":"Directed graphs with unique paths of fixed lengths","volume":"24","author":"Lam","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0743-7315(88)90004-4_BIB8","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TC.1976.1674637","article-title":"Interconnections between processors and memory modules using the shuffle-exchange network","volume":"C-25","author":"Lang","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(88)90004-4_BIB9","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in an array processor","volume":"C-24","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(88)90004-4_BIB10","series-title":"Proc. Workshop on Interconnection Networks for Parallel and Distributed Processing","first-page":"116","article-title":"Analysis of message switching with shuffle exchanges in multiprocessors","author":"Lawrie","year":"1980"},{"key":"10.1016\/0743-7315(88)90004-4_BIB11","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0024-3795(68)90021-9","article-title":"An application of matrix theory to a problem in universal algebra","volume":"1","author":"Mendelsohn","year":"1968","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0743-7315(88)90004-4_BIB12","series-title":"Combinatorial Mathematics and its Applications","article-title":"Directed graphs with the unique path property","author":"Mendelsohn","year":"1969"},{"key":"10.1016\/0743-7315(88)90004-4_BIB13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.1980.1675553","article-title":"Notes on shuffle-exchange type switching networks","volume":"C-29","author":"Parker","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(88)90004-4_BIB14","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","article-title":"The indirect binary n-cube microprocessor array","volume":"C-26","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(88)90004-4_BIB15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(88)90004-4_BIB16","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"C-29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731588900044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731588900044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:31Z","timestamp":1757514571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731588900044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0743731588900044"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(88)90004-4","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1988,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Uniform minimal full-access networks","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(88)90004-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}