"Finding All-Pairs Shortest Path for a Large-Scale Transportation Network ..."

Anu Pradhan, G. (Kumar) Mahinthakumar (2013)

> Home

Details and statistics

DOI: 10.1061/(ASCE)CP.1943-5487.0000220

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jccee/PradhanM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jccee/PradhanM13
Anu Pradhan, G. (Kumar) Mahinthakumar:
Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms. J. Comput. Civ. Eng. 27(3): 263-273 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.