International Workshop on Combinatorial Algorithms

IWOCA 2014: Combinatorial Algorithms pp 318-329

Efficiently Listing Bounded Length st-Paths

  • Romeo Rizzi
  • Gustavo Sacomoto
  • Marie-France Sagot
Conference paper

DOI: 10.1007/978-3-319-19315-1_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8986)
Cite this paper as:
Rizzi R., Sacomoto G., Sagot MF. (2015) Efficiently Listing Bounded Length st-Paths. In: Jan K., Miller M., Froncek D. (eds) Combinatorial Algorithms. IWOCA 2014. Lecture Notes in Computer Science, vol 8986. Springer, Cham

Abstract

The problem of listing the K shortest simple (loopless) st-paths in a graph has been studied since the early 1960s. For a non-negatively weighted graph with n vertices and m edges, the most efficient solution is an \(O(K(mn + n^2 \log n))\) algorithm for directed graphs by Yen and Lawler [Management Science, 1971 and 1972], and an \(O(K(m+n \log n))\) algorithm for the undirected version by Katoh et al. [Networks, 1982], both using \(O(Kn + m)\) space. In this work, we consider a different parameterization for this problem: instead of bounding the number of st-paths output, we bound their length. For the bounded length parameterization, we propose new non-trivial algorithms matching the time complexity of the classic algorithms but using only \(O(m+n)\) space. Moreover, we provide a unified framework such that the solutions to both parameterizations – the classic K-shortest and the new length-bounded paths – can be seen as two different traversals of a same tree, a Dijkstra-like and a DFS-like traversal, respectively.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Romeo Rizzi
    • 1
  • Gustavo Sacomoto
    • 2
    • 3
  • Marie-France Sagot
    • 2
    • 3
    • 4
  1. 1.Dipartimento di InformaticaUniversità di VeronaVeronaItaly
  2. 2.Université de LyonLyonFrance
  3. 3.CNRS, UMR5558, Laboratoire de Biométrie et Biologie ÉvolutiveUniversité Lyon 1VilleurbanneFrance
  4. 4.INRIA Grenoble Rhône-AlpesMontbonnot-saint-martinFrance

Personalised recommendations