The Design of Small-Diameter Networks by Local Search

Authors:
S. Toueg;K. Steiglitz
Affiliations:
Department of Electrical Engineering and Computer Science, Princeton University;-
Venue:
IEEE Transactions on Computers
Year:
1979

Citing 0
Cited 6

Deadlock-free packet switching networks

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Design to Minimize Diameter on Building-Block Network

IEEE Transactions on Computers
Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers
Torus and Other Networks as Communication Networks With Up to Some Hundred Points

IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter

IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem

IEEE Transactions on Computers - Lecture notes in computer science Vol. 174

Quantified Score

Hi-index	14.99

Visualization

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.