dc.contributor.author |
Kim, Y.-B |
en |
dc.contributor.author |
Dinneen, Michael |
en |
dc.date.accessioned |
2009-04-16T23:12:48Z |
en |
dc.date.available |
2009-04-16T23:12:48Z |
en |
dc.date.issued |
2007-11 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-313 (2007) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3820 |
en |
dc.description.abstract |
In a field of network design, engineers desire better ways to design efficient
communication network. While designing such network, we are restricted with
engineering constraints such as communication delays and hardware costs. Many
construction techniques have been proposed. In this paper we focus on compounding techniques and provide (∆,D) tables that contain the largest compound graphs
for given degree ∆ and diameter D. We also empirically verify a few of the recently
discovered large compound graphs. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
A Repository of Compound Graphs for use in Large Network Design |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |