{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:25:09Z","timestamp":1648610709698},"reference-count":15,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/0165-6074(91)90407-k","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:56:11Z","timestamp":1060304171000},"page":"593-599","source":"Crossref","is-referenced-by-count":0,"title":["On hardware for generating routes in Kautz digraphs"],"prefix":"10.1016","volume":"32","author":[{"given":"Gerard J.M.","family":"Smit","sequence":"first","affiliation":[]},{"given":"Paul J.M.","family":"Havinga","sequence":"additional","affiliation":[]},{"given":"Pierre G.","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Fokke","family":"de Boer","sequence":"additional","affiliation":[]},{"given":"Bert","family":"Molenkamp","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(91)90407-K_BIB1","series-title":"Graphs and hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0165-6074(91)90407-K_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BF01788663","article-title":"Large Fault-Tolerant Interconnection Networks","author":"Bermond","year":"1989"},{"key":"10.1016\/0165-6074(91)90407-K_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0095-8956(80)90091-X","article-title":"On the impossibility of directed Moore graphs","author":"Bridge","year":"1980","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0165-6074(91)90407-K_BIB4","first-page":"758","article-title":"A combinatorial problem","volume":"A49","author":"de Bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Academie van Wetenschappen Proc."},{"key":"10.1016\/0165-6074(91)90407-K_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1995-5","article-title":"A VLSI Architecture for Concurrent Data Structures","author":"Dally","year":"1987"},{"key":"10.1016\/0165-6074(91)90407-K_BIB6","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d,k) digraph problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0165-6074(91)90407-K_BIB7","series-title":"The connection machine","author":"Hillis","year":"1985"},{"key":"10.1016\/0165-6074(91)90407-K_BIB8","article-title":"Mapping of algorithms on processor networks","author":"Hilbers","year":"1989"},{"key":"10.1016\/0165-6074(91)90407-K_BIB9","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graphs with minimum diameter","volume":"vol c-32","author":"Imase","year":"1983","journal-title":"IEEE Trans. on Comp."},{"issue":"no 8","key":"10.1016\/0165-6074(91)90407-K_BIB10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/scj.4690170803","article-title":"A fault-tolerant processor interconnection network","volume":"Vol 17","author":"Imase","year":"1986","journal-title":"Systems and Computers in Japan"},{"key":"10.1016\/0165-6074(91)90407-K_BIB11","first-page":"20","article-title":"Bounds on directed (d,k) graphs. Theory of cellular logic networks and machines","author":"Kautz","year":"1968","journal-title":"AFCRL-68-0668 Final report"},{"issue":"no 1","key":"10.1016\/0165-6074(91)90407-K_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"Vol 28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0165-6074(91)90407-K_BIB13","article-title":"An algorithm for generating node disjoint routes in Kautz digraphs","author":"Smit","year":"1990"},{"key":"10.1016\/0165-6074(91)90407-K_BIB14","series-title":"Proceedings Fifth International Parallel Processing Symposium","article-title":"An algorithm for generating node disjoint routes in Kautz digraphs","author":"Smit","year":"1991"},{"key":"10.1016\/0165-6074(91)90407-K_BIB15","author":"IEEE Standard VHDL","year":"1987"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749190407K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749190407K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T22:56:04Z","timestamp":1552604164000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749190407K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":15,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["016560749190407K"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(91)90407-k","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}