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. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Nepomniaschaya, A. (2011). Efficient associative algorithm for finding the second simple shortest paths in a digraph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6873 LNCS, pp. 182–191). https://doi.org/10.1007/978-3-642-23178-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
