Semi-dynamic shortest paths and breadth-first search in digraphs
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.
Unable to display preview. Download preview PDF.
- 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
- 4.S. Even and H. Gazit. Updating distances in dynamic graphs. Methods of Operations Research, 49:371–387, 1985.Google Scholar
- 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.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.F. Harary. Graph Theory. Addison-Wesley, Reading, Mass., 1969.Google Scholar
- 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.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.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
- 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.R. E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic Discrete Methods, 6(2):306–318, 1985.Google Scholar