This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design to Minimize Diameter on Building-Block Network
June 1981 (vol. 30 no. 6)
pp. 439-442
M. Imase, Musashino Electrical Communication Laboratory, Nippon Telegraph and Telephone Public Corporation
This paper proposes a simple algorithm for the graph design of small-diameter networks. For given nodes n and degree d, this algorithm can be used to construct a directed graph with diameter ?logd n?, which is at most one larger than the lower bound ?logd (n(d - 1) + 1)? - 1. Its average distance is also close to the lower bound. The algorithm can be used to construct a directed graph with smaller diameter, compared with any other conventional methods, when n is larger.
Index Terms:
undirected graph, Building-block, diameter minimization, distance, lower bounds, nearly optimum solution, switching system
Citation:
M. Imase, M. Itoh, "Design to Minimize Diameter on Building-Block Network," IEEE Transactions on Computers, vol. 30, no. 6, pp. 439-442, June 1981, doi:10.1109/TC.1981.1675809
Usage of this product signifies your acceptance of the Terms of Use.