All Pairs Shortest Paths on a Hypercube Multiprocessor.
Document Type
Conference Proceeding
Publication Date
12-1-1987
Abstract
Two plausible ways to implement Floyd's all-pairs-shortest-paths algorithm on a hypercube multiprocessor are considered. These are evaluated experimentally. A comparison with results for Dijkstra's single-source-all-destination algorithm on each processor is carried out.
Montclair State University Digital Commons Citation
Jenq, John and Sahni, Sartaj, "All Pairs Shortest Paths on a Hypercube Multiprocessor." (1987). Department of Computer Science Faculty Scholarship and Creative Works. 96.
https://digitalcommons.montclair.edu/compusci-facpubs/96
COinS