DocumentCode :
1152929
Title :
A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation
Author :
Sinha, Bhabani P. ; Bhattacharya, Bhargab B. ; Ghose, Suranjan ; Srimani, Pradip K.
Author_Institution :
Electronics Unit, Indian Statistical Institute
Issue :
11
fYear :
1986
Firstpage :
1000
Lastpage :
1004
Abstract :
In this correspondence we develop a parallel algorithm to compute the all-pairs shortest paths and the diameter of a given graph. Next, this algorithm is mapped into a suitable VLSI systolic architecture and the performance of this proposed VLSI implementation is evaluated.
Keywords :
Diameter; VLSI architecture; parallel algorithms; pipelining; shortest paths; Communication networks; Computer architecture; Computer science; Concurrent computing; Costs; Hardware; Parallel algorithms; Shortest path problem; Vectors; Very large scale integration; Diameter; VLSI architecture; parallel algorithms; pipelining; shortest paths;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1986.1676702
Filename :
1676702
Link To Document :
بازگشت