{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:42:27Z","timestamp":1755034947391},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"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":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90141-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"297-317","source":"Crossref","is-referenced-by-count":19,"special_numbering":"C","title":["Broadcasting and spanning trees in de Bruijn and Kautz networks"],"prefix":"10.1016","volume":"37-38","author":[{"given":"M.C.","family":"Heydemann","sequence":"first","affiliation":[]},{"given":"J.","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"D.","family":"Sotteau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90141-V_BIB1","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\/0166-218X(92)90141-V_BIB2","series-title":"Tech. Rept. 88-4","article-title":"New minimum broadcast graphs and sparse broadcast graphs","author":"Bermond","year":"1988"},{"key":"10.1016\/0166-218X(92)90141-V_BIB3","first-page":"283","article-title":"Broadcasting in de Bruijn networks","volume":"66","author":"Bermond","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)90141-V_BIB4","series-title":"Proceedings of the 1st European Workshop on Hypercubes 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\/0166-218X(92)90141-V_BIB5","series-title":"Th\u00e9se d'\u00e9tat","article-title":"Grands r\u00e9seaux d'interconnexion","author":"Bond","year":"1987"},{"key":"10.1016\/0166-218X(92)90141-V_BIB6","article-title":"Time bounds for broadcasting in bounded degree graphs","author":"Capocelli","year":"1989","journal-title":"WG 89 15th International Workshop on Graph Theoretic Concepts in Computer Science"},{"key":"10.1016\/0166-218X(92)90141-V_BIB7","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A"},{"key":"10.1016\/0166-218X(92)90141-V_BIB8","doi-asserted-by":"crossref","unstructured":"L. Fernandez de la Vega, Private communication, 1989.","DOI":"10.1039\/c39890000653"},{"key":"10.1016\/0166-218X(92)90141-V_BIB9_1","unstructured":"M. Grigni and D. Peleg, Tight bounds on minimum broadcast networks, Tech. Rept. MIT\/LCS\/TM-374"},{"key":"10.1016\/0166-218X(92)90141-V_BIB9_2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","article-title":"Tight bounds on minimum broadcast networks","volume":"4","author":"Grigni","year":"1992","journal-title":"SIAM J. Discrete Math"},{"key":"10.1016\/0166-218X(92)90141-V_BIB10_1","unstructured":"A.L. Listman and J.G. Peters, Minimum broadcast digraphs, Preprint"},{"key":"10.1016\/0166-218X(92)90141-V_BIB10_2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0166-218X(92)90148-4","article-title":"Minimum broadcast digraphs","volume":"37\/38","author":"Liestman","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90141-V_BIB11","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","article-title":"Information dissemination in trees","volume":"10","author":"Slater","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290141V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290141V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:30Z","timestamp":1555136610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290141V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":13,"alternative-id":["0166218X9290141V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90141-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}