An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs

Authors:
A. S. Nepomniaschaya
Affiliations:
-
Venue:
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Year:
2001

Citing 4
Cited 1

A simple implementation of Dijkstra's shortest path algorithm on associative parallel processors

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Content Addressable Parallel Processors

Content Addressable Parallel Processors
Solution of Path Problems Using Associative Parallel Processors

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)

Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper by means of a model of associative parallel systems with vertical data processing (the STAR-machine), we propose a natural straight forward implementation of the Bellman-Ford shortest path algorithm. We represent this algorithm as the corresponding STAR procedure, justify its correctness and evaluate time complexity.