An Incremental Algorithm for a Generalization of the Shortest-Path Problem

Journal of Algorithms

Volumn 21, Issue 2, 1996, Pages 267-305

  Ramalingam, G ^a,b   Reps, Thomas ^a  

^a University of Wisconsin Madison   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HYPERGRAPH; OPTIMIZATION METHOD; SHORTEST PATH;

CONTEXT FREE GRAMMARS; GRAPH THEORY;

ALGORITHMS;

EID: 0030353548     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0046     Document Type: Article

References (38)

1. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck, Incremental evaluation of computational circuits, in "Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, Jan. 22-24, 1990," pp. 32-42, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990.
2. G. Ausiello, G. F. Italiano, A. M. Spaccamela, and U. Nanni, Incremental algorithms for minimal length paths, pp. 12-21 in "Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, Jan. 22-24, 1990," pp. 12-21, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990.
3. G. Ausiello, U. Nanni, and G. F. Italiano, Dynamic maintenance of directed hypergraphs, Theoret. Comput. Sci. 72(3) (1990), 97-117.
4. G. Ausiello, G. F. Italiano, A. M. Spaccamela, and U. Nanni, Incremental algorithms for minimal length paths, J. Algorithms 12 (1991), 615-638.
5. G. Ausiello, G. F. Italiano, and U. Nanni, Optimal traversal of directed hypergraphs, TR-92-073, September 1992.
6. C. Berge, "Graphs and Hypergraphs," North-Holland, Amsterdam, 1973.
7. C. Berge, "Hypergraphs: Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989.
8. M. D. Carroll, "Data Flow Update via Dominator and Attribute Updates," Ph.D. dissertation, Rutgers University, New Brunswick, NJ, May 1988.
9. G. A. Cheston, "Incremental Algorithms in Graph Theory," Ph.D. dissertation and Technical Report 91, Department of Computer Science, University of Toronto, Toronto, Canada, Mar. 1976.
10. G. A. Cheston and D. G. Corneil, Graph property update algorithms and their application to distance matrices, INFOR 20(3) (1982), 178-201.
11. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959), 269-271.
12. R. Dionne, Etude et extension d'un algorithme de Murchland, INFOR 16(2) (June 1978), 132-146.
13. J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan, Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation, Commun. ACM 31(11) (1988), 1343-1354.
14. J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J. Assoc. Comput. Mach. 19 (1972), 248-264.
15. S. Even and H. Gazit, Updating distances in dynamic graphs, in "IX Symposium on Operations Research, Osnabrueck, West Germany, Aug. 27-29, 1984, Methods of Operations Research" (P. Brucker and R. Pauly, Eds.), Vol. 49, pp. 271-388, Verlag Anton Hain, 1985.
16. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach. 34(3) (1987), 596-615.
17. M. L. Fredman and D. E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, in "Proceedings of the 31st Annual Symposium on Foundations of Computer Science Volume II, St. Louis, Missouri, Oct. 1990, pp. 719-725, IEEE Computer Society, Washington, DC, 1990.
18. G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, Directed hypergraphs and applications, Discrete Appl. Math. 42 (1993), 177-201.
19. M. Gondran and M. Minoux, "Graphs and Algorithms," Wiley, New York, 1984.
20. S. Goto and A. Sangiovanni-Vincentelli, A new shortest path updating algorithm, Networks 8(4) (1978), 341-372.
21. A. K. Halder, The method of competing links, Transportation Sci. 4 (1970), 36-51.
22. W. Hsieh, A. Kershenbaum, and B. Golden, Constrained routing in large sparse networks, in "Proceedings of IEEE International Conference on Communications," pp. 38.14-38.18, Philadelphia, PA, 1976.
23. G. F. Italiano and U. Nanni, On line maintenance of minimal directed hypergraphs, in "Proceedings 3rd Convegno Italiano di Informatica Teorica (Mantova)," pp. 335-349, World Science Press, (1989).
24. D. E. Knuth, A generalization of Dijkstra's algorithm, Inform. Process. Lett. 6 (1) (1977), 1-5.
25. C.-C. Lin and R.-C. Chang, On the dynamic shortest path problem, J. Inform. Process. 13(4) (1990).
26. P. Loubal, A network evaluation procedure, Highway Res. Record 205 (1967), 96-109.
27. J. D. Murchland, "The Effect of Increasing or Decreasing the Length of a Single Arc on all Shortest Distances in a Graph," Technical Report LBS-TNT-26, London Business School, Transport Network Theory Unit, London, UK, 1967.
28. J. D. Murchland, "A Fixed Matrix Method for all Shortest Distances in a Directed Graph and for the Inverse Problem," Doctoral dissertation, Universität Karlsruhe, Karlsruhe, West Germany.
29. U. Pape, Netzwerk-veraenderungen und korrektur kuerzester weglaengen von einer wurzelmenge zu allen anderen knoten, Computing 12 (1974), 357-362.
30. G. Ramalingam and T. Reps, "On the Computational Complexity of Incremental Algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI, Aug. 1991.
31. G. Ramalingam and T. Reps, "An Incremental Algorithm for a Generalization of the Shortest-Path Problem," TR-1087, Computer Sciences Department, University of Wisconsin, Madison, WI, May 1992.
32. G. Ramalingam, "Bounded Incremental Computation," Ph.D. dissertation and Technical Report TR-1172, Computer Sciences Department, University of Wisconsin, Madison, WI, Aug. 1993.
33. T. Reps, "Generating Language-Based Environments," MIT Press, Cambridge, MA, 1984.
34. V. Rodionov, The parametric problem of shortest distances, U.S.S.R. Comput. Math. Math. Phys. 8(5) (1968), 336-343.
35. H. Rohnert, A dynamization of the all pairs least cost path problem, pp. 279-286 in "Proceedings of STAGS 85: Second Annual Symposium on Theoretical Aspects of Computer Science, Saarbruecken, West Germany, Jan. 3-5, 1985 (K. Melhorn, Ed.), Lecture Notes in Computer Science, Vol. 182, pp. 279-286, Springer-Verlag, New York, 1985.
36. P. M. Spira and A. Pan, On finding and updating spanning trees and shortest paths, SIAM J. Comput. 4(3) (1975), 375-380.
37. R. E. Tarjan, "Data Structures and Network Algorithms," Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
38. C. K. Yap, A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs, Inform. Process. Lett. 16 (May 1983), 181-182.