Cite
HARVARD Citation
Heywood, P. et al. (2019). A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment. Transportation research. pp. 332-347. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Heywood, P. et al. (2019). A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment. Transportation research. pp. 332-347. [Online].