Reducing the Diameters of Computer Networks

Authors:
Shahid H. Bokhari;A. D. Raza
Affiliations:
Langley Research Center, Hampton, VA;Electronic Switching System, Lahoe, Pakistan
Venue:
IEEE Transactions on Computers
Year:
1986

Citing 5
Cited 0

PACS: a parallel microprocessor array for scientific calculations

ACM Transactions on Computer Systems (TOCS)
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
On the Mapping Problem

IEEE Transactions on Computers
Parallel Image Processing Using Cellular Arrays

Computer

Quantified Score

Hi-index	14.98

Visualization

Abstract

We discuss three methods of reducing the diameters of computer networks by adding additional processor to processor links under the constraint that no more than one I/O port be added to each processor. This is equivalent to adding edges to a given graph under the constraint that the degree of any node be increased, at most, by one.