This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Design of Small-Diameter Networks by Local Search
July 1979 (vol. 28 no. 7)
pp. 537-542
S. Toueg, Department of Electrical Engineering and Computer Science, Princeton University
A local search algorithm for the design of small-diameter networks is presented for both directed and undirected regular graphs. In all cases the resulting graphs are at least as good as any previously known, in the sense that they have at least as small a diameter and average shortest distance for a given number of nodes and degrees.
Index Terms:
networks, Communication networks, delay, diameter, graphs
Citation:
S. Toueg, K. Steiglitz, "The Design of Small-Diameter Networks by Local Search," IEEE Transactions on Computers, vol. 28, no. 7, pp. 537-542, July 1979, doi:10.1109/TC.1979.1675402
Usage of this product signifies your acceptance of the Terms of Use.