Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction
We consider a non-orthodox representation of directed graphs which uses the “disjoint set forest” data structure. We show how such a representation can be used in order to efficiently find the dominator tree. Even though the performance of our algorithm does not improve over the already known algorithms for constructing the dominator tree, the approach is new and it gives place to a highly structured and simple to follow proof of correctness.
KeywordsSpan Tree Dominator Tree Graph Transformation Input Graph Outgoing Edge
Unable to display preview. Download preview PDF.
- 1.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company (1989)Google Scholar
- 2.Georgiadis, L., Tarjan, R.E.: Finding dominators revisited: extended abstract. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 869–878. SIAM (2004)Google Scholar
- 4.Prosser, R.T.: Applications of boolean matrices to the analysis of flow diagrams. Papers Presented at the Eastern Joint IRE-AIEE-ACM Computer Conference, IRE-AIEE-ACM 1959 (Eastern), December 1-3, pp. 133–138. ACM Press, New York (1959), http://doi.acm.org/10.1145/1460299.1460314 CrossRefGoogle Scholar