The Community for Technology Leaders
Green Image
Issue No. 07 - July (1979 vol. 28)
ISSN: 0018-9340
pp: 537-542
S. Toueg , Department of Electrical Engineering and Computer Science, Princeton University
ABSTRACT
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
K. Steiglitz, S. Toueg, "The Design of Small-Diameter Networks by Local Search", IEEE Transactions on Computers, vol. 28, no. , pp. 537-542, July 1979, doi:10.1109/TC.1979.1675402
233 ms
(Ver 3.1 (10032016))