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

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

PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies

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

Fundamenta Informaticae

Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph

PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies

Accelerating large graph algorithms on the GPU using CUDA

HiPC'07 Proceedings of the 14th international conference on High performance computing

Efficient associative algorithm for finding the second simple shortest paths in a digraph

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies

Associative parallel algorithm for dynamic reconstruction of a minimum spanning tree after deletion of a vertex

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies