{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:20:29Z","timestamp":1648812029851},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00244-5","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"431-446","source":"Crossref","is-referenced-by-count":1,"title":["Sparse Hypercube\u2014a minimal k-line broadcast graph"],"prefix":"10.1016","volume":"127","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur M.","family":"Farley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00244-5_BIB1","first-page":"104","article-title":"Twisted cubes: a study in asymmetry","volume":"13","author":"Abraham","year":"1991","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB2","doi-asserted-by":"crossref","unstructured":"B. Aiello, T. Leighton, Coding theory, hypercube embeddings, and fault tolerance, in: Proceedings of the Third SPAA, ACM, 1991, pp. 125\u2013136.","DOI":"10.1145\/113379.113391"},{"issue":"5","key":"10.1016\/S0166-218X(02)00244-5_BIB3","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1109\/12.4617","article-title":"The cubical ring connected cycles: a fault-tolerant parallel computation network","volume":"37","author":"Banerjee","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230260302","article-title":"Antepenultimate broadcasting","volume":"26","author":"Bermond","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90226-Z","article-title":"Sparse broadcast graphs","volume":"36","author":"Bermond","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB6","first-page":"110","article-title":"Constructing minimal broadcast networks","volume":"10","author":"Chau","year":"1985","journal-title":"J. Combin. Inform. System Sci."},{"issue":"5","key":"10.1016\/S0166-218X(02)00244-5_BIB7","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection network","volume":"36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB8","doi-asserted-by":"crossref","unstructured":"M.J. Dinneen, M.R. Fellows, V. Faber, Algebraic constructions of efficient broadcast networks, in: Proceedings of Ninth AAECC Meeting, Lecture Notes in Computer Science, Vol. 539, 1991, pp. 152\u2013158.","DOI":"10.1007\/3-540-54522-0_104"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0166-218X(99)00043-8","article-title":"Compound constructions of minimal broadcast networks","volume":"93","author":"Dinneen","year":"1999","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"10.1016\/S0166-218X(02)00244-5_BIB10","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/12.102840","article-title":"A variation on the hypercube with lower diameter","volume":"40","author":"Efe","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(02)00244-5_BIB11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.80187","article-title":"Properties and performance of folded hypercubes","volume":"2","author":"El-Amawy","year":"1991","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"issue":"1","key":"10.1016\/S0166-218X(02)00244-5_BIB12","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/12.67323","article-title":"The twisted N-cube with application to multiprocessing","volume":"40","author":"Esfahanian","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","article-title":"Minimal broadcast networks","volume":"9","author":"Farley","year":"1979","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","article-title":"Minimum-time line broadcast networks","volume":"10","author":"Farley","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","article-title":"Minimum broadcast graphs","volume":"25","author":"Farley","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB16","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(02)00244-5_BIB17","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, J.G. Peters, Minimum linear gossip graphs and maximal linear (\u0394,k)-gossip graphs. Networks, 36 (2001) 150\u2013162.","DOI":"10.1002\/net.1033"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB18","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1002\/net.3230190606","article-title":"On the construction of minimal broadcast networks","volume":"19","author":"Gargano","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0166-218X(99)00108-0","article-title":"More broadcast graphs","volume":"98","author":"Harutyunyan","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB20","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(02)00244-5_BIB21","doi-asserted-by":"crossref","unstructured":"P.A.J. Hilbers, M.R.J. Koopman, J.L.A. Snepscheut, The twisted cube, in: Proceedings of PARLE\u201991: Parallel Architectures and Languages Europe, Lecture Notes in Computer Science, Vol. 506, Springer, Berlin, 1987, pp. 152\u2013159.","DOI":"10.1007\/3-540-17943-7_126"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB22","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine, Dissemination of information in interconnection networks (Broadcasting and Gossiping); in: F. Hsu, D.-Z. Du (Eds.), Combinatorial Network Theory, Science Press & AMS, to appear."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB23","unstructured":"L.H. Khachatrian, H.S. Haroutunian, Construction of new classes of minimal broadcast networks, in: Proceedings of Third International Colloquium on Coding Theory, 1990, pp. 69\u201377."},{"key":"10.1016\/S0166-218X(02)00244-5_BIB24","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230260409","article-title":"Multiple messages broadcasting in communication networks","volume":"26","author":"Kwon","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB25","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"issue":"10","key":"10.1016\/S0166-218X(02)00244-5_BIB26","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","article-title":"Fat-trees: universal networks for hardware-efficient supercomputing","volume":"C-34","author":"Leiserson","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0166-218X(02)00244-5_BIB27","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(02)00244-5_BIB28","series-title":"Coding and Information Theory","author":"Roman","year":"1992"},{"issue":"1\u20132","key":"10.1016\/S0166-218X(02)00244-5_BIB29","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0255(94)90070-1","article-title":"The full-cube topology: properties and routing","volume":"76","author":"Sibai","year":"1994","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/S0166-218X(02)00244-5_BIB30","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/12.123384","article-title":"Sorting with linear speedup on a pipelined hypercube","volume":"41","author":"Varman","year":"1992","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002445?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002445?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T19:53:23Z","timestamp":1555185203000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02002445"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00244-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}