Paper Info
Title
Parallel algorithms for solving aggregated shortest-path problems
Abstract
We consider the problem of computing in parallel all pairs of shortest paths in a general large-scale directed network of N nodes. A hierarchical network decomposition algorithm is provided that yields for an important subclass of problems logN savings in computation time over the traditional parallel implementation of Dijkstra's algorithm. Error bounds are provided for the procedure and are illustrated numerically for a problem motivated by Intelligent Transportation Systems.
Year
DOI
Venue
1999
10.1016/S0305-0548(99)00029-5
Computers & OR
Keywords
DocType
Volume
parallel algorithm,aggregated shortest-path problem
Journal
26
Issue
ISSN
Citations 
10-11
Computers and Operations Research
6
PageRank 
References 
Authors
0.78
3
2
Name
Order
Citations
PageRank
H. Edwin Romeijn176983.88
Robert L. Smith2664123.86