dc.contributor.author |
Dinneen, Michael |
en |
dc.contributor.author |
Pritchard, Geoffrey |
en |
dc.contributor.author |
Wilson, Mark |
en |
dc.date.accessioned |
2013-12-04T23:22:19Z |
en |
dc.date.issued |
2002 |
en |
dc.identifier.citation |
Networks 39(3):121-129 May 2002 |
en |
dc.identifier.issn |
0028-3045 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/21206 |
en |
dc.description.abstract |
We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. This paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast networks. |
en |
dc.relation.ispartofseries |
Networks |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://media.wiley.com/assets/1540/86/ctaaglobal.pdf http://www.sherpa.ac.uk/romeo/issn/0028-3045/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Degree- and time-constrained broadcast networks |
en |
dc.type |
Journal Article |
en |
dc.identifier.doi |
10.1002/net.10018 |
en |
pubs.issue |
3 |
en |
pubs.begin-page |
121 |
en |
pubs.volume |
39 |
en |
dc.description.version |
AM - Accepted Manuscript |
en |
pubs.end-page |
129 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Article |
en |
pubs.elements-id |
4645 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.org-id |
Statistics |
en |
dc.identifier.eissn |
1097-0037 |
en |
pubs.record-created-at-source-date |
2010-09-01 |
en |