{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:32:29Z","timestamp":1775838749978,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0167-8191(02)00073-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"649-666","source":"Crossref","is-referenced-by-count":5,"title":["Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance"],"prefix":"10.1016","volume":"28","author":[{"given":"Abderezak","family":"Touzene","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00073-X_BIB1","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 Applied Mathematics"},{"issue":"2","key":"10.1016\/S0167-8191(02)00073-X_BIB2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1142\/S0219265901000312","article-title":"Tight bounds for broadcasting the linear cost model","volume":"2","author":"Beauquier","year":"2001","journal-title":"Journal of Interconnection Networks"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0166-218X(97)00113-3","article-title":"Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks","volume":"83","author":"Perennes","year":"1998","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/S0167-8191(02)00073-X_BIB4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1142\/S0129626498000201","article-title":"Neighbourhood gossiping in the hypercube","volume":"8","author":"Fujita","year":"1998","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(94)00087-5","article-title":"Two edge-disjoint Hamiltonian cycles in the Butterfly graph","volume":"51","author":"Barth","year":"1994","journal-title":"Information Processing Letters"},{"issue":"3","key":"10.1016\/S0167-8191(02)00073-X_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1142\/S0129626498000389","article-title":"Hamilton cycle decomposition of the Butterfly networks","volume":"8","author":"Bermond","year":"1998","journal-title":"Parallel Processing Letters"},{"issue":"1\u20133","key":"10.1016\/S0167-8191(02)00073-X_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(97)00095-4","article-title":"Hamilton circuits in the directed wrapped butterfly network","volume":"84","author":"Bermond","year":"1998","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0167-8191(02)00073-X_BIB8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/71.481595","article-title":"A new family of Cayley graph interconnection networks of constant degree four","volume":"7","author":"Vadapalli","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB9","doi-asserted-by":"crossref","unstructured":"R. Klasing, B. Monien, R. Peine, E.A. Stohr, Broadcasting in butterfly and de Bruijn networks, Proc. STACS 92, Lecture Notes in Computer Science, pp. 351\u2013362","DOI":"10.1007\/3-540-55210-3_196"},{"issue":"25","key":"10.1016\/S0167-8191(02)00073-X_BIB10","first-page":"249","article-title":"One-to-all Broadcast algorithm for Constant Degree 4 Cayley Graphs","volume":"3","author":"Touzene","year":"1999","journal-title":"Parallel Computing"},{"issue":"12","key":"10.1016\/S0167-8191(02)00073-X_BIB11","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1109\/71.640022","article-title":"Comments on a new family of Cayley graph interconnection networks of constant degree four","volume":"8","author":"Chen","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB12","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1972"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(74)90087-2","article-title":"Bounds on the number of disjoint spanning trees","volume":"17","author":"Kundu","year":"1974","journal-title":"Journal of Combinatorial Theory"},{"issue":"9","key":"10.1016\/S0167-8191(02)00073-X_BIB14","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimal broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Transaction on Computers"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB15","unstructured":"O. Delmas, Trade-off for broadcast protocols, Proceedings of 5th International Coloquium on Structural Information Communication Complexity (SIROCCO 5), Carleton Scientific, June 1998, pp. 36\u201350"},{"issue":"2","key":"10.1016\/S0167-8191(02)00073-X_BIB16","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.485370","article-title":"Edge-disjoint spanning trees on the star network with applications to fault tolerance","volume":"45","author":"Fragopoulou","year":"1996","journal-title":"IEEE Transaction on Computers"},{"key":"10.1016\/S0167-8191(02)00073-X_BIB17","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, Fault-tolerant gossiping on hypercube multicomputers, Proceedings of EDMCC2, Munchen, 1991, pp. 463\u2013472","DOI":"10.1007\/BFb0032962"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200073X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200073X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T06:57:11Z","timestamp":1578466631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781910200073X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S016781910200073X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00073-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}