Dominators in linear time

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2117-2132

  Alstrup, Stephen ^a   Harel, Dov ^b   Lauridsen, Peter W ^a   Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

DOMINATOR TREES; LINEAR TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 0033330108     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797317263     Document Type: Article

References (25)

1. A. AHO, J. HOPCROFT, AND J. ULLMAN, On finding lowest common ancestors in trees, in Fifth Annual ACM Symposium on the Theory of Computing, 1973, pp. 115-132.
2. A. AHO AND J. ULLMAN, The Theory of Parsing, Translation and Compiling, vol. II, Prentice-Hall, Englewood Cliffs, N.J., 1972.
3. A. AHO AND J. ULLMAN, Principles of Compiler design, Addison-Wesley, Reading, MA, 1979.
4. G. BILARDI AND K. PINGALI, A framework for generalized control dependence, in ACM SIGPLAN Conference on Programming Language Design and Implementation, 1996, pp. 291-300.
5. A. BUCHSBAUM, H. KAPLAN, A. ROGERS, AND J. WESTBROOK, Linear-time pointer-machine algorithms for lca's, mst verification, and dominators, in Annual ACM Symposium on the theory of computing (STOC), vol. 30, 1998.
6. R. CYTRON, J. FERRANTE, B. ROSEN, M. WEGMAN, AND F. ZADEK, Efficiently computing static single assignment form and the control dependence graph, in ACM Trans. Programming Language Systems, 13 (1991), pp. 451-490.
7. B. DIXON AND R. TARJAN, Optimal parallel verification of minimum spanning trees in logarithmic time, Algorithmica, 17 (1997), pp. 11-18.
8. J. DRISCOLL, H. GABOW, R. SHRAIRMAN, AND R. TARJAN, Relaxed heaps: An alternative to fibonacci heaps with application to parallel computation, Comm. ACM, 31 (1988), pp. 1343-1354.
9. M. FREDMAN AND D. WILLARD, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci., 48 (1994), pp. 533-551.
10. H. GABOW, Data structure for weighted matching and nearest common ancestors with linking, in First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 434-443.
11. H. GABOW AND R. TARJAN, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci., 30 (1985), pp. 209-221.
12. G. GAO AND V. SREEDHAR, A linear time algorithm for placing φ-nodes, in ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages, 1995, pp. 62-73.
13. D. HAREL, A linear time algorithm for finding dominators in flow graphs and related problems, in 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 185-194.
14. D. KNUTH, The Art of Programming, vol. 1, Addison-Wesley, Reading, MA, 1968.
15. P. LAURIDSEN, Dominators, Master's Thesis, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark, 1996.
16. T. LENGAUER AND R. TARJAN, A fast algorithm for finding dominators in a flowgraph, in ACM Trans. Programming Languages Systems, 1 (1979), pp. 121-141.
17. E. LOWRY AND C. MEDLOCK, Object code optimization, Comm. ACM, 12 (1969), pp. 13-22.
18. R. OCHRANOVA, Finding dominators, in Foundations of Computation Theory, Lecture Notes in Comput. Sci., 4 (1983), pp. 328-334.
19. P. PURDOM AND E. MOORE, Immediate predominators in a directed graph, Comm. ACM, 15 (1972), pp. 777-778.
20. G. RAMALINGAM AND T. REPS, An incremental algorithm for maintaining the dominator tree of a reducible flowgraph, in 21st Annual ACM Symposium on Principles of Programming Languages, 1994, pp. 287-298.
21. R. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
22. R. TARJAN, Finding dominators in directed graphs, SIAM J. Comput., 3 (1974), pp. 62-89.
23. R. TARJAN, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. System Sci., 18 (1979), pp. 110-127.
24. J. VUILLEMIN, A data structure for manipulating priority queues, Comm. ACM, 21 (1978), pp. 309-315.
25. N. WIRTH, Programming in modula-2(3rd corr.ed), Springer-Verlag, Berlin, New York, 1985.