Internet Archive Scholar

Efficient Parallel Shortest Path Algorithms for Banded Matrices

Y. Han, Y. Igarashi
1993 1993 International Conference on Parallel Processing - ICPP'93 Vol3  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (982.7 kB)
https://web.archive.org/web/20170922072844/https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/84041/1/0871-25.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

We present efficient parallel shortest path algorithms for an $n\cross n$
doi:10.1109/icpp.1993.73 dblp:conf/icpp/HanI93 fatcat:m6im2ymvv5ek3jruyae4jsxs2a
Citation

Y. Han, Y. Igarashi. "Efficient Parallel Shortest Path Algorithms for Banded Matrices." 1993 International Conference on Parallel Processing - ICPP'93 Vol3 (1993) 223-226