A linear algorithm for finding dominators in flow graphs and related problems

  • Authors:

  • D Harel

  • Affiliations:

  • Intermetrics Inc., Cambridge, Massachusetts

  • Venue:
  • STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the first part of the paper we show how to extend recent methods for solving a special case of the union-find problem in linear time, to a special case of the eval-link-update problem for computing the minimum function defined on paths of trees. In the cases where our approach is applicable, we give a way to perform m eval, link, and update operations on n elements in O(m + n) time and O(n) space, improved from O(m &agr;(m + n, n) + n) time and O(n) space in the more general case, where &agr; is a functional inverse of Ackermans function. The technique gives similar improvements in the efficiency of algorithms for solving several network optimization problems in the case where all the keys involved are integers in some suitable range. In the second part of the paper we show how to use the new technique for speeding up the fastest known algorithm for finding dominators in flow graphs so that it runs in linear time. We introduce the notions of pseudo and external dominators which are both computable in linear time and make the technique introduced in the first part applicable for finding immediate dominators. We first give an algorithm for a limited class of graphs which include cycle free graphs, and thus can be used to find dominators in reducible flow graphs. We then show how to extend our technique for computing dominators on any flow graph. All the algorithms we describe run on a Random Access Machine.