A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation

DOI10.1109/TC.1986.1676702MaRDI QIDQ3758251zbMATH OpenOpenAlexFDO

Authors Bhabani P. Sinha, Suranjan Ghose, Pradip K. Srimani, Bhargab B. Bhattacharya

Publication date 1986

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1986.1676702

zbMATH Keywords

parallel algorithmdiameterpipeliningall-pairs shortest pathsVLSI systolic architecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3858435
• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 4201626
• New fast parallel algorithm for the connected component problem and its VLSI implementation
• A parallel shortest path algorithm

Cited in

(1)

• scientific article; zbMATH DE number 3858435 (Why is no real title available?)

This page was built for publication: A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758251)