Abstract
The paper proposes a symbolic technique for shortest-path problems. This technique is based on a presentation of a shortest-path algorithm as a symbolic expression. Literals of this expression are arc tags of a graph, and they are substituted for corresponding arc weights which appear in the algorithm. The search for the most efficient algorithm is reduced to the construction of the shortest expression. The advantage of this method, compared with classical numeric algorithms, is its stability and faster reaction to data renewal. These problems are solved with reference to two kinds of n-node digraphs: Fibonacci graphs and complete source-target directed acyclic graphs. \(O(n^{2})\) and \(O\left( 2^{\left\lceil \log _{2}n\right\rceil ^{2}-\left\lceil \log _{2}n\right\rceil }\right) \) complexity algorithms, respectively, are provided in these cases.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akian, M., Babat, R., Gaubert, S.: Max-plus algebra. In: Hogben, L. et al. (eds.) Handbook of Linear Algebra. Discrete Mathematics and its Applications, vol. 39, chapter 25. Chapman & Hall/CRC, Boca Raton (2007)
Aljazzar, H., Leue, S.: K*: a heuristic search algorithm for finding the \(K\) shortest paths. Artif. Intell. 175, 2129–2154 (2011)
Bein, W.W., Kamburowski, J., Stallmann, M.F.M.: Optimal reduction of two-terminal directed acyclic graphs. SIAM J. Comput. 21(6), 1112–1129 (1992)
Butkovič, P.: Max-algebra: the linear algebra of combinatorics? Linear Algebr. Its Appl. 367, 313–335 (2003)
Cormen, T.H., Leiseron, C.E., Rivest, R.L.: Introduction to Algorithms, 3rd edn, The MIT Press, Cambridge, Massachusetts (2009)
Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303–318 (1965)
Golumbic, M.C., Perl, Y.: Generalized Fibonacci maximum path graphs. Discret. Math. 28, 237–245 (1979)
Korenblit, M., Levit, V.E.: On algebraic expressions of series-parallel and Fibonacci graphs. In: Calude, C.S., Dinneen, M.J., Vajnovzki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 215–224. Springer, Heidelberg (2003)
Korenblit, M., Levit, V.E.: Estimation of expressions’ complexities for two-terminal directed acyclic graphs. Electron. Notes Discret. Math. 63, 109–116 (2017)
Sedeño-Noda, A.: An efficient time and space \(K\) point-to-point shortest simple paths algorithm. Appl. Math. Comput. 218, 10244–10257 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Korenblit, M., Levit, V.E. (2020). Symbolic Solutions of Shortest-Path Problems and Their Applications. In: Tuba, M., Akashe, S., Joshi, A. (eds) ICT Systems and Sustainability. Advances in Intelligent Systems and Computing, vol 1077. Springer, Singapore. https://doi.org/10.1007/978-981-15-0936-0_30
Download citation
DOI: https://doi.org/10.1007/978-981-15-0936-0_30
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0935-3
Online ISBN: 978-981-15-0936-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)