Semi-dynamic shortest paths and breadth-first search in digraphs

  • Paolo Giulio Franciosa
  • Daniele Frigioni
  • Roberto Giaccio
Algorithms I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1200)


We show how to maintain a shortest path tree of a general directed graph G with unit edge weights and n vertices, during a sequence of edge deletions or a sequence of edge insertions, in O(n) amortized time per operation using linear space. Distance queries can be answered in constant time, while shortest path queries can be answered in time linear in the length of the retrieved path. These results are extended to the case of integer edge weights in [1,C], with a bound of O(Cn) amortized time per operation.

We also show how to maintain a breadth-first search tree of a directed graph G in an incremental or a decremental setting in O(n) amortized time per operation using linear space.


Short Path Span Tree Directed Graph Edge Deletion Source Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths. Journal of Algorithms, 12(4):615–638, 1991.CrossRefGoogle Scholar
  2. 2.
    S. Chaudhuri and C. D. Zaroliagis. Shortest path queries in digraphs of small treewidth. In Proc. of 22nd Int. Colloq. on Automata, Languages and Programming (ICALP '95), volume 944 of Lecture Notes in Computer Science, pages 244–255. Springer-Verlag, 1995.Google Scholar
  3. 3.
    E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.CrossRefGoogle Scholar
  4. 4.
    S. Even and H. Gazit. Updating distances in dynamic graphs. Methods of Operations Research, 49:371–387, 1985.Google Scholar
  5. 5.
    S. Even and Y. Shiloach. An on-line edge deletion problem. Journal of ACM, 28:1–4, 1981.CrossRefGoogle Scholar
  6. 6.
    E. Feuerstein and A. Marchetti-Spaccamela. On-line algorithms for shortest paths in planar graphs. Theoretical Computer Science, 116:359–371, 1993.CrossRefGoogle Scholar
  7. 7.
    P. G. Franciosa, G. Gambosi, and U. Nanni. On the structure of DFS-Forests on directed graphs and the dynamic maintenance of DFS on DAG's. In Proc. of 2nd European Symposium on Algorithms (ESA '94), volume 855 of Lecture Notes in Computer Science, pages 343–353. Springer-Verlag, 1994.Google Scholar
  8. 8.
    D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic output bounded single source shortest path problem. In Proc. of 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '96), pages 212–221, Atlanta, Georgia, 1996.Google Scholar
  9. 9.
    F. Harary. Graph Theory. Addison-Wesley, Reading, Mass., 1969.Google Scholar
  10. 10.
    P. N. Klein, S. Rao, M. H. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In Proc. of 23rd ACM Symposium on Theory of Computing (STOC '94), pages 27–37. Assoc. for Computing Machinery, 1994.Google Scholar
  11. 11.
    P. N. Klein and S. Subramanian. A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs. In Proc. of 3rd Workshop on Algorithms and Data Structures (WADS '93), volume 709 of Lecture Notes in Computer Science, pages 442–451. Springer-Verlag, 1993.Google Scholar
  12. 12.
    J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, pages 527–631. Elsevier, Amsterdam, 1990.Google Scholar
  13. 13.
    U. Manber. Recognizing breadth-first search trees in linear time. Information Processing Letters, 34:167–171, 1990.CrossRefGoogle Scholar
  14. 14.
    H. Rohnert. A dynamization of the all-pairs least cost problem. In Proc. of 2nd Sympos. on Theoretical Aspects of Computer Science (STACS '85), volume 182 of Lecture Notes in Computer Science, pages 279–286. Springer Verlag, 1985.Google Scholar
  15. 15.
    R. E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic Discrete Methods, 6(2):306–318, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Paolo Giulio Franciosa
    • 1
  • Daniele Frigioni
    • 1
    • 2
  • Roberto Giaccio
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItaly
  2. 2.Dipartimento di Matematica Pura ed ApplicataUniversità di L'AquilaCoppitoItaly

Personalised recommendations