A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation (Q3758251)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation |
scientific article |
Statements
A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation (English)
0 references
1986
0 references
pipelining
0 references
parallel algorithm
0 references
all-pairs shortest paths
0 references
diameter
0 references
VLSI systolic architecture
0 references
