All Pairs Shortest Paths on a Hypercube Multiprocessor

@inproceedings{Jenq1987AllPS,
  title={All Pairs Shortest Paths on a Hypercube Multiprocessor},
  author={Jing-Fu Jenq and Sartaj Sahni},
  booktitle={ICPP},
  year={1987}
}
Two plausible ways to implement Floyd’s all pairs shortest paths algorithm on a hypercube mutiprocessor are considered. These are evaluated experimentally. A comparison with using Dijkstra’s single source all desitination algorithm on each processor is also done.