Issue No. 07 - July (1979 vol. 28)
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.
networks, Communication networks, delay, diameter, graphs
K. Steiglitz and S. Toueg, "The Design of Small-Diameter Networks by Local Search," in IEEE Transactions on Computers, vol. 28, no. , pp. 537-542, 1979.