0
  • DE
  • EN
  • FR
  • International Database and Gallery of Structures

Advertisement

Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

Author(s):

Medium: journal article
Language(s): English
Published in: Journal of Computing in Civil Engineering, , n. 3, v. 27
Page(s): 263-273
DOI: 10.1061/(asce)cp.1943-5487.0000220
Structurae cannot make the full text of this publication available at this time. The full text can be accessed through the publisher via the DOI: 10.1061/(asce)cp.1943-5487.0000220.
  • About this
    data sheet
  • Reference-ID
    10259316
  • Published on:
    29/12/2018
  • Last updated on:
    29/12/2018
 
Structurae cooperates with
International Association for Bridge and Structural Engineering (IABSE)
e-mosty Magazine
e-BrIM Magazine