Incremental algorithms for the single-source shortest path problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 880 LNCS, Issue , 1994, Pages 113-124

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

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DIRECTED GRAPHS; GRAPHIC METHODS; SOFTWARE ENGINEERING;

ALGORITHMS AND DATA STRUCTURES; AMORTIZED TIME; BOUNDED DEGREE GRAPHS; BOUNDED-TREEWIDTH GRAPHS; INCREMENTAL ALGORITHM; SINGLE SOURCE SHORTEST PATH PROBLEMS; SINGLE-SOURCE SHORTEST PATH TREES; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 85000444119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58715-2_118     Document Type: Conference Paper

References (17)

1. A. V. Aho, J. E. Hopcroft, and J. D. Uliman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974
2. S. Arnborg, Efficient Algorithms for Combinatorial Problems on Graphs with Bounded De-composability-A survey, BIT, 25, 2-23, 1985.
3. H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson, T. Kloks, Approximating Treewidth, Path-width, and Minimum Elimination Tree Height, Proceedings International Workshop on Graph-theoretic Concepts in Computer Science (WG 91), Lecture Notes in Computer Science, 570, Springer-Verlag, 1-13.
4. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni, Incremental Algorithms for Minimal Length Paths, Journal of Algorithms, 12, 4 (December 1991), 615-638.
5. E. W. Dijkstra, A note on two problems in connection with graphs, Numerical Maihtmaiics 1, 1959.
6. S. Even, and H. Gazit, Updating distances in dynamic graphs, Methods of Operations Research 49 (1985), 371-387
7. E. Feuerstein, and A. Marchetti-Spaccamela, On-line Algorithms for Shortest Paths in Planar Graphs, Theoretical Computer Science to appear.
8. G. N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SI AM Journal on Computing 16, 6, (December 1987).
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, Proceedings ACM Symposium on Theory of Computing (1994), to appear.
11. P. N. Klein and S. Subramanian, Fully Dynamic Approximation Schemes for Shortest Path Problems in Planar Graphs, Proceedings International Workshop on Algorithms and Data Structures (WADS 93).
12. R. J. Lipton and R. E. Tarjan, A Separator Theorem for Planar Graphs, SIAM Journal of Applied Mathematics, 36 (1979), 177-189.
13. G. Ramalingam and T. Reps, On the computational complexity of Incremental Algorithms, Tech, Rep. Computer Science Department, University of Wisconsin, Madison (1991).
14. G. Ramalingam and T. Reps, An Incremental Algorithm for a Generalization of the Shortest Path Problem, Tech. Rep. n.1087, Computer Science Department, University of Wisconsin, Madison (1992).
15. G. Ramalingam, Bounded Incremental Computation, Tech. Rep. 1172, Computer Science Department, University of Wisconsin, Madison (August 1993).
16. H. Rohnert, A dynarnization of the all-pairs least cost path problem, Proceedings Snd Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 182, Springer-Verlag (1990), 279-286.
17. R. E. Tarjan, Amortized computational complexity, SIAM Journal on Algebraic and Discrete Methods, 6 (1985), 306-318.