{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:09Z","timestamp":1720624929049},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81013-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"196-208","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An Optimal Family of Directed, Bounded-Degree Broadcast Networks"],"prefix":"10.1016","volume":"78","author":[{"given":"Michael J.","family":"Dinneen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nian","family":"(Alfred)Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(93)E0145-O","article-title":"\u201cVertex symmetric digraphs with small diameter\u201d","volume":"58","author":"Francesc","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0020-0190(00)00118-6","article-title":"\u201cDeterministic Small-world communication networks\u201d","volume":"76","author":"Francesc","year":"2000","journal-title":"Inform. Process. Letters"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB3","first-page":"53","article-title":"\u201cGroup-theoretic methods for designing networks\u201d","volume":"65","author":"Dinneen","year":"1998","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB4","series-title":"Applied Algebra, algebraic Algorithms and Error-Correcting Codes","first-page":"150","article-title":"\u201cAlgebraic constructions of efficient broadcast networks\u201d","author":"Dinneen","year":"1991"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/net.3230240702","article-title":"\u201cNew results for the degree\/diameter problem\u201d","volume":"24","author":"Dinneen","year":"1994","journal-title":"Networks"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Dinneen, Michael J., Geoffrey Pritchard and Mark C. Wilson, \u201cDegree and time- constrained broadcast networks\u201d, University of Auckland Report CDMTCS-080, 1998. [Also in Networks 39(3), 121\u2013129, 2002.]","DOI":"10.1002\/net.10018"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Dinneen, Michael J., Jose A. Ventura, Mark C. Wilson and golbon Zakeri, \u201cCompound constructions of minimal broadcast networks\u201d, CDMTCS research report 026, 1997, Discrete Applied Mathematics, 93:205\u2013232, January 1999.","DOI":"10.1016\/S0166-218X(99)00043-8"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB8","first-page":"313","article-title":"\u201cMinimum broadcast networks\u201d","author":"Farley","year":"1977","journal-title":"Networks 9"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB9","article-title":"\u201cHigh-degree low-diameter interconnection networks with vertex symmetry: directed case\u201d","author":"Vance","year":"1994","journal-title":"Tech. Rept. LA-UR-88-1051 (Los Alamos National Laboratory, Los Alamos, NM"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(99)00282-0","article-title":"\u201cOn the structure of minimum broadcast digraphs\u201d","volume":"245","author":"Guillaume","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB11","unstructured":"Guo, Fang, \u201cFinding the minimum broadcast time of bounded degree networks by backtracking\u201d, Master Thesis, Department of Computer Science, The University of Auckland, Auckland, New Zealand, 2001."},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Hafner, Paul R., \u201cLarge Cayley graph and digraphs with small degree and diameter\u201d, University of Auckland Report CDMTCS-004, 1995. Wieb Bosma and Alf van der Poorten (eds) Computational Algebra and Number Theory Mathematics and Its Applications 325; Kluwer Academic Publishers dordrecht\/Boston\/London (1995), pp. 291\u2013302; ISBN 0-7923\u20133501\u20135","DOI":"10.1007\/978-94-017-1108-1_21"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"\u201cA survey of gossiping and broadcasting in communication networks\u201d","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB14","series-title":"\u201cDissemination of information in interconnection networks (Broadcasting & Gossiping)\u201d, F. Hsu, D.-Z(DES.), Combinatorial Network Theory","article-title":"Burkhard Monien and Regine Peine","author":"Juraj","year":"1996"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB15","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","article-title":"\u201cBroadcast networks of bounded degree\u201d","volume":"1","author":"Liestman","year":"1988","journal-title":"SIAM J. Discr. Math"},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB16","unstructured":"Wang, Haobi, \u201cBroadcasting heuristics and planar networks\u201d, Graduate project, Department of Computer Science, University of Auckland, Auckland, New Zealand, 1999."},{"key":"10.1016\/S1571-0661(04)81013-2_NEWBIB17","unstructured":"Zhou, Nian (Alfred), \u201cThe broadcasting problem for bounded-degree directed networks\u201d, Master Thesis, Department of Computer Science, University of Auckland, Auckland, New Zealand, 2002. (see http:\/\/www.cs.auckland.ac.nz\/CDMTCS\/researchreports\/193alfred.pdf)"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:53Z","timestamp":1549191233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":17,"alternative-id":["S1571066104810132"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81013-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}