A Unified Approach to Path Problems

Journal of the ACM (JACM)

Volumn 28, Issue 3, 1981, Pages 577-593

  Tarjan, Robert Endre ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

code optimization; compiling; Ganss Jordan ehmmatlon; Gaussian elmamation; global flow analysis; graph algorithm; linear algebra; path problem; regular expression; semdattlce; shortest path; sparse matrix

Indexed keywords

COMPUTER PROGRAMMING;

MATHEMATICAL TECHNIQUES;

EID: 0019588127     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322261.322272     Document Type: Article

References (35)

1. Aho, A. V., Hopcroft, J. E., And Ullman, J D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974, pp 195-206.
2. Aho, A. V., And Ullman, J. D. Principles of Compiler Design Addison-Wesley, Reading, Mass, 1977, pp 408-517.
3. Backhouse, R. C., And Carre, B. A. Regular algebra applied to path-finding problems. J. Inst. Math. Apphc. 15 (1975), 161-186.
4. Bunch, J. R., And Hopcroft, J. E. Triangular factorization and inversion by fast matrix multiplication. Math. Comput. 28 (1974), 231-236.
5. Cousot, P., And Cousot, R. Abstract interpretation. A unified lattice model for static analysis of programs by construction or approximation of fixpoints Conf. Rec. 4th ACM Symp. on Principles of Programming Languages, Los Angeles, Calif., 1977, pp 238-252.
6. Dukstra, E. W., A note on two problems in connexion with graphs Numer Math. 1 (1959), 269-271
7. Floyd, R. Algorithm 97. Shortest path. Commun. ACM 5, 6 (June 1962), 345.
8. Fong, A. C., Generalized common subexpressions in very high level languages Conf. Rec 4th ACM Symp on Principles of Programming Languages, Los Angeles, Calif, 1977, pp 48-57.
9. Fong, A. C., Kam, J B., And Ullman, J. D. Applications of lattice algebra to loop optimization Conf. Rec. 2nd ACM Symp on Principles of Programming Languages, Palo Alto, Calif, 1975, pp 1-9
10. Ford, L. R. Jr., And Fulkerson, D. R. Flows m Networks. Princeton University Press, Princeton, N. J., 1962, pp 130-134
11. Forsythe, G. E., And Moler, C. B. Computer Solution of Linear Algebraic Equations. Prentice-Hall, Englewood Cliffs, N. J., 1967, pp 27-36.
12. Fredman, M. L. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5 (1976), 83-89
13. Graham, S. L., and Wegman, M. A., fast and usually linear algorithm for global flow analysis. J. ACM 23, 1 (Jan 1976), 172-202
14. Hecht, M. S. Flow Analysis of Computer Programs. Elsevier, New York, 1977
15. Hecht, M. S., And Ullman, J. D. Flow graph reducibility SIAM J. Comput. 1 (1972), 188-202
16. Johnson, D. B., Efficient algorithms for shortest paths in sparse networks J. ACM 24, 1 (Jan. 1977), 1-13.
17. Kam, J. B., And Ullman, J. D. Global data flow analysis and iterative algorithms. J ACM 23, 1 (Jan. 1976), 158-171
18. Kam, J. B., And Ullman, J. D. Monotone data flow analysis frameworks Acta Inf 7 (1977), 305-317.
19. Kennedy, K. W., Node listings applied to data flow analysis. Conf. Rec 2nd ACM Symp. on Principles of Programming Languages, Palo Alto, Calif, 1975, pp. 10-21
20. Kildall, G. A. A., unified approach to program optimization Conf. Rec ACM Symp on Principles of Programming Languages, Boston, Mass., 1973, pp 10-21.
21. Kleene, S. C. Representation of events in nerve nets and finite automata. In Automata Studies, C. E. Shannon and J. McCarthy, Eds., Princeton University Press, Princeton, N. J., 1956, pp. 3-40.
22. Lehmann, D. J. Algebraic structures for transitive closure. Theor. Comput. Sci. 4 (1977), 59-76.
23. Pan, V. Y. Strassen's algorithm is not optimal. Tnlinear technique of aggregating uniting and canceling for constructing fast algonthms for matrix operations. Proc. 19th Ann IEEE Symp on Foundations of Computer Science, Ann Arbor, Mich, 1978, pp 166-176.
24. Rosen, B. K. Monoids for rapid data flow analysis. SIAM J. Comput. 9 (1980), 159-196
25. Salomaa, A. Two complete axiom systems for the algebra of regular events. J. ACM, 1 (Jan 1966), 158-169.
26. Schaefer, M., A Mathematical Theory of Global Program Optimization. Prentice-Hall, Englewood Cliffs, N. J., 1973
27. Strassen, V. Gaussian elimination is not optimal Numer. Math 13 (1969), 354-356.
28. Szasz, G. Introduction to Lattice Theory, B. Balkay and G. Toth, Trans., Academic Press, New York, 1963, pp 38-42, 59-60
29. Tarjan, R. E. Testing flow graph reducibility J. Comput Syst Sci, 9 (1974), 355-365
30. Tarjan, R. E. Iterative algorithms for global flow analysis In Algorithms and Complexity, New Directions and Recent Results, J F Traub, Ed., Academic Press, New York, 1976, pp 91-102.
31. Tarjan, R. E. Fast algorithms for solvmg path problems, J. ACM 28, 3 (July 1981), 594-614.
32. Ullman, J. D., Fast algorithms for the elimination of common subexpressions Acta Inf. 2 (1973), 191-213.
33. Wagner, R. A. A., shortest path algonthm for edge-sparse graphs. J ACM 23, 1 (Jan 1976), 50-57.
34. Warshall, S. A. theorem on Boolean matrices. J. ACM 9, 1 (Jan. 1962), 11-12.
35. Wegbreit, B. Property extraction m well-founded property sets. IEEE Trans. Softw Eng. I (1975), 270-285.