{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T12:07:57Z","timestamp":1696939677143},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00115-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"279-301","source":"Crossref","is-referenced-by-count":5,"title":["Uniform homomorphisms of de Bruijn and Kautz networks"],"prefix":"10.1016","volume":"83","author":[{"given":"Pavel","family":"Tvrdik","sequence":"first","affiliation":[]},{"given":"Rabah","family":"Harbane","sequence":"additional","affiliation":[]},{"given":"Marie-Claude","family":"Heydemann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00115-7_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/021\/01","article-title":"Ranking algorithms for hamiltonian paths in hypercubic networks","volume":"21","author":"Annexstein","year":"1995","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"1","key":"10.1016\/S0166-218X(97)00115-7_BIB2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539791197852","article-title":"Broadcasting and gossiping in de Bruijn networks","volume":"23","author":"Bermond","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB3","series-title":"Hypercube and Distributed Computers","first-page":"279","article-title":"De Bruijn and Kautz networks: a competitor for the hypercube?","author":"Bermond","year":"1989"},{"key":"10.1016\/S0166-218X(97)00115-7_BIB4","article-title":"Distributed computing: structure and complexity","author":"Bodlaender","year":"1987"},{"key":"10.1016\/S0166-218X(97)00115-7_BIB5","article-title":"Grands r\u00e9seaux d'interconnexion","author":"Bond","year":"1987"},{"key":"10.1016\/S0166-218X(97)00115-7_BIB6","first-page":"758","article-title":"A combinatorical problem","volume":"A49","author":"de Bruijn","year":"1946"},{"issue":"5","key":"10.1016\/S0166-218X(97)00115-7_BIB7","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. Comput."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB8","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TC.1982.1675994","article-title":"Quotient networks","volume":"C-31","author":"Fishburn","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB9","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 rep."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB10","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","article-title":"On a homomorphism of the de Bruijn graph and its application to the design of feedback shift registers","volume":"C-19","author":"Lempel","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB11","article-title":"Communications dans les r\u00e9seaux de processeurs","author":"de Rumeur","year":"1994"},{"issue":"4","key":"10.1016\/S0166-218X(97)00115-7_BIB12","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/12.21149","article-title":"The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI","volume":"C-38","author":"Samatham","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-218X(97)00115-7","article-title":"Uniform homomorphisms of the de Bruijn and Kautz networks","author":"Tvrdik","year":"1995"},{"key":"10.1016\/S0166-218X(97)00115-7_BIB14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/0166-218X(92)90156-5","article-title":"The underlying graph of a line digraph","volume":"37\/38","author":"Villar","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00115-7_BIB15","series-title":"Proc. of the 4th Symp. on the Frontiers'92","first-page":"583","article-title":"Optimal implementation of parallel Divide-and-Conquer algorithms on de Bruijn networks","author":"Zhong","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001157?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:19Z","timestamp":1556117479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001157"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00115-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}