Fully dynamic output bounded single source shortest path problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 212-221

  Frigioni, Daniele ^a,b   Marchetti Spaccamela, Alberto ^b   Nanni, Umberto ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPHIC METHODS; TREES (MATHEMATICS);

BOUNDED DEGREE GRAPHS; BOUNDED-TREEWIDTH GRAPHS; DIJKSTRA'S ALGORITHMS; EDGE MODIFICATION; FULLY DYNAMIC ALGORITHMS; SHORTEST PATH TREE; SINGLE SOURCE SHORTEST PATH PROBLEMS; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 84942799271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. R. K. Ahuia, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ (1993).
2. S. Arnborg, Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability - A survey, BIT, 25 (1985), 2-23.
3. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela and U. Nanni, Incremental Algorithms for Minimal Length Paths, J. Algorithms, 12, 4 (1991), 615-638.
4. S. Chaudhuri and C. D. Zaroliagis, Shortest Path Queries in Digraph of Small Treewidth, Proc. Int. Coll. Aut. Lang. Progr. (ICALP '95), 1995; LNCS 944, 244-255.
5. M. Chrobak and D. Eppstein, Planar orientations with low out-degree and compaction of adjacency matrices, Th. Comp. Sci., 86 (1991), 243-266.
6. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math., 1 (1959), 269-271.
7. S. Even and H. Gazit, Updating distances in dynamic graphs, Meth. Oper. Res., 49 (1985), 371-387.
8. D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Incremental Algorithms for the Single Source Shortest Path Problem, Proc. 14th Int. Conf. FST&TCS '94, 1994; LNCS 880, 113-124.
9. F. Harary, Graph Theory, Addison-Wesley (1969).
10. P. N. Klein, S. Rao, M. Rauch and S. Subramanian, Faster shortest-path algorithms for planar graphs, Proc. 26th ACM Symp. Theory of Comp. (STOC '94), 1994, 27-37.
11. P. N. Klein and S. Subramanian, Fully Dynamic Approximation Schemes for Shortest Path Problems in Planar Graphs, Proc. Int. Workshop Alg. Data Struct. (WADS '93), 1993; LNCS 709, 443-451.
12. H. La Poutré, personal communication, 1994.
13. R. J. Lipton and R. E. Tarjan, A Separator Theorem for Planar Graphs, SIAM J. Appl. Math., 36 (1979), 177-189.
14. S. M. Malitz, Genus g Graphs Have Pagenumber O(√/g), J. Algorithms, 17 (1994), 85-109.
15. K. Mehlhorn and S. Nāher, LEDA, a Platform for Combinatorial and Geometric Computing, Comm. of the ACM., 38 (1995).
16. C. Nash-Williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc., 36 (1961), 445-450.
17. V. Radhakrishnan, H.B. Hunt III and R. Stearns, Efficient Algorithms for Solving Systems of Linear Equations and Path Problems, Proc. Annual Symp. Th. Aspects Comp. Sci. (STACS '92), 1992; LNCS 577, 109-119.
18. G. Ramalingam and T. Reps, An Incremental Algorithm for a Generalization of the Shortest Path Problem, Tech. Rep. 1087, Comp. Sc. Dept, Un. of Wisconsin, Madison, WI (1992).
19. H. Rohnert, A dynamization of the all-pairs least cost path problem, Proc. Annual Symp. Th. Aspects Comp. Sci. (STACS '85), 1985; lncs 182, 279-286.
20. R. E. Tarjan, Amortized computational complexity, SIAM J. Alg. Discr. Meth., 6 (1985), 306-318.