Finding Dominators in Directed Graphs
- 1 March 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 3 (1) , 62-89
- https://doi.org/10.1137/0203006
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Algorithm 430 [H]: Immediate predominators in a directed graphCommunications of the ACM, 1972
- Flow Graph ReducibilitySIAM Journal on Computing, 1972
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Efficiency of Equivalence AlgorithmsPublished by Springer Nature ,1972
- Analysis of Graphs by Ordering of NodesJournal of the ACM, 1972
- Control flow analysisACM SIGPLAN Notices, 1970
- Object code optimizationCommunications of the ACM, 1969