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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
Eppstein, D.: Finding the k Shortest Paths. SIAM J. of Computing 28, 652–673 (1998)
Foster, C.C.: Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976)
Gotthilf, Z., Lewenstein, M.: Improved Algorithms for the k Simple Shortest Paths and the Replacement Paths Problems. Information Processing Letters 109, 352–355 (2009)
Katoh, N., Ibaraki, T., Mine, H.: An Efficient Algorithm for k Shortest Simple Paths. Networks 12, 411–427 (1982)
Lawler, E.L.: A Procedure for Computing the k Best Solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem. Management Science 18, 401–405 (1972)
Nepomniaschaya, A.S.: Language STAR for Associative and Parallel Computation with Vertical Data Processing. In: Mirenkov, N. (ed.) Proc. of the Intern. Conf. ”Parallel Computing Technologies, pp. 258–265. World Scientific, Singapore (1991)
Nepomniaschaya, A.S., Dvoskina, M.A.: A Simple Implementation of Dijkstra’s Shortest Path Algorithm on Associative Parallel Processors. Fundamenta Informaticae 43, 227–243 (2000)
Nepomniaschaya, A.S.: Simultaneous Finding the Shortest Paths and Distances in Directed Graphs Using Associative Parallel Processors. In: Proc. of the Intern. Conf. ”Information Visualization”, IV 2003, pp. 665–670. IEEE Computer Society, Los Alamitos (2003)
Nepomniaschaya, A.S.: Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees. In: Proc. of the Intern. Conf. on Parallel Computing in Electrical Engineering, PARELEC 2002, pp. 399–404. IEEE Computer Society, Los Alamitos (2002)
Roditty, L., Zwick, U.: Replacement paths and k simple shortest paths in unweighted directed graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 249–260. Springer, Heidelberg (2005)
Yen, J.Y.: Finding the k Shortest Loopless Paths in a Network. Management Science 17(11), 712–716 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nepomniaschaya, A. (2011). Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2011. Lecture Notes in Computer Science, vol 6873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23178-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-23178-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23177-3
Online ISBN: 978-3-642-23178-0
eBook Packages: Computer ScienceComputer Science (R0)