An experimental comparison of two distributed single-source shortest path algorithms-Reference-Cited by-同舟云学术

An experimental comparison of two distributed single-source shortest path algorithms

Published:1995-09 Issue:9 Volume:21 Page:1505-1532
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Träff Jesper Larsson

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference28 articles.

1. Greedy partitioned algorithms for the shortest path problem;Adamson;Int. J. Parallel Programming,1991

2. Parallel algorithms for the single-source shortest path problem;Adamson,1992

3. An auction algorithm for shortest paths;Bertsekas;SIAM J. Optimization,1991

4. Parallel synchronous and asynchronous implementations of the auction algorithm;Bertsekas;Parallel Computing,1991

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A parallel computing framework for solving user equilibrium problem on computer clusters;Transportmetrica A: Transport Science;2020-01-01

2. Optimization model of conventional missile maneuvering route based on improved Floyd algorithm;AIP Conference Proceedings;2018

3. Research on the Cognitive Model Artificial Fish based on Virtual Marine Environment;2016

4. Tilewise Accumulated Cost Surface Computation with Graphics Processing Units;ACM Transactions on Spatial Algorithms and Systems;2015-11-05

5. An Engineering Service Restoration Method after a 35kV Substation Outage;Applied Mechanics and Materials;2014-12