{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:38:43Z","timestamp":1648975123592},"reference-count":25,"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)00113-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:32Z","timestamp":1027608932000},"page":"247-262","source":"Crossref","is-referenced-by-count":8,"title":["Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks"],"prefix":"10.1016","volume":"83","author":[{"given":"St\u00e9phane","family":"Perennes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00113-3_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: a survey","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/0166-218X(92)90160-C","article-title":"Table of large (\u0394, D) graphs","volume":"37\/38","author":"Bermond","year":"1992","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/S0166-218X(97)00113-3_BIB3","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1002\/jgt.3190170512","article-title":"Chromatic index of the Kautz and de Bruijn digraphs","volume":"17","author":"Bermond","year":"1993","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/S0166-218X(97)00113-3_BIB4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0405002","article-title":"Broadcasting in bounded degree graphs","volume":"5","author":"Bermond","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB5","series-title":"Proceedings of EUROPAR'96","first-page":"311","article-title":"Induced broadcasting algorithms in iterated line digraphs","volume":"vol. 1123","author":"Bermond","year":"1995"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB6","series-title":"Proceedings of SIRROCO'95","first-page":"199","article-title":"Efficient broadcasting protocols on the de Bruijn and similar networks","author":"Bermond","year":"1995"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB7","series-title":"Graph theory and Computing","first-page":"267","article-title":"Broadcasting in de Bruijn networks, Proceedings of the 19th Southeastern Conference on Combinatorics","volume":"66","author":"Bermond","year":"1988"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB8","series-title":"Hypercube and Distributed Computers, Proceedings of the ls European Colloque on Hypercubes","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)00113-3_BIB9","first-page":"758","article-title":"A combinatorial problem","volume":"vol. A49","author":"de Bruijn","year":"1946"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0895-7177(93)90253-U","article-title":"The hamiltonian property of consecutive d digraphs","volume":"17","author":"Du","year":"1993","journal-title":"Math. Comput. Modeling"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB11","series-title":"Parallel Algorithms and Architectures","author":"Leighton","year":"1992"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1142\/S0129626492000131","article-title":"The CCC is a subgraph of the Butterfly","volume":"2","author":"Felmann","year":"1992","journal-title":"Parallel Processing Lett."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0166-218X(92)90141-V","article-title":"Broadcasting and spanning trees in de Bruijn and Kautz networks","volume":"27\u201328","author":"Heydemann","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(94)00210-P","article-title":"A note on recursive properties of de Bruijn, Kautz and FFT digraphs","volume":"53","author":"Heydemann","year":"1995","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB17","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (Broadcasting and Gossiping)","author":"Hromkovic","year":"1995"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on building-block network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB19","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graphs with minimum diameter","volume":"C-32","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0166-218X(97)00113-3_BIB20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameters","volume":"34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0166-218X(97)00113-3_BIB21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TC.1984.1676410","article-title":"Families of fixed degree graphs for processor interconnection","volume":"C-33","author":"Jerrum","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(94)90184-8","article-title":"Broadcasting and gossiping in the butterfly and de Bruijn networks","volume":"53","author":"Klasing","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00113-3_BIB23","series-title":"Proceedings of EUROPAR'96","first-page":"325","article-title":"Lower bounds on broadcasting time of de Bruijn networks","volume":"vol. 1123","author":"Perennes","year":"1996"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB24","article-title":"Directed graphs with minimal diameter and maximum node connectivity","author":"Reddy","year":"1980"},{"key":"10.1016\/S0166-218X(97)00113-3_BIB25","series-title":"Communications dans les R\u00e9seaux de Processeurs","author":"de Rumeur","year":"1994"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:55:32Z","timestamp":1556394932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001133"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00113-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}