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

Authors:
Anna Nepomniaschaya
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Novosibirsk, Russia
Venue:
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Year:
2011

Citing 6
Cited 0

Finding the k Shortest Paths

SIAM Journal on Computing
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
Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees

PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Improved algorithms for the k simple shortest paths and the replacement paths problems

Information Processing Letters
Replacement paths and k simple shortest paths in unweighted directed graphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an associative algorithm for finding the second simple shortest paths from the source vertex to other vertices of a directed weighted graph. Our model of computation (the STAR-machine) simulates the run of associative (content addressable) parallel systems of the SIMD type with vertical processing. We first propose the data structure that uses the graph representation as a list of triples (edge end-points and the weight) and the shortest paths tree obtained by means of the classical Dijkstra algorithm. The associative algorithm is given as the procedure SecondPaths, whose correctness is proved and the time complexity is evaluated.