Symbolic Solutions of Shortest-Path Problems and Their Applications

Mark Korenblit, Vadim E. Levit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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. and complexity algorithms, respectively, are provided in these cases.

Original languageEnglish
Title of host publicationICT Systems and Sustainability - Proceedings of ICT4SD 2019
EditorsMilan Tuba, Shyam Akashe, Amit Joshi
Number of pages9
StatePublished - 2020
Event4th International Conference on ICT for Sustainable Development, ICT4SD 2019 - Panaji, India
Duration: 5 Jul 20196 Jul 2019

Publication series

NameAdvances in Intelligent Systems and Computing
ISSN (Print)2194-5357
ISSN (Electronic)2194-5365


Conference4th International Conference on ICT for Sustainable Development, ICT4SD 2019


  • DAG
  • Expression
  • Fibonacci graph
  • Max-algebra
  • Series-parallel graph
  • Shortest path


Dive into the research topics of 'Symbolic Solutions of Shortest-Path Problems and Their Applications'. Together they form a unique fingerprint.

Cite this