Finding dominators revisited

  • Tarjan R
  • Georgiadis L
  • 20


    Mendeley users who have this article in their library.
  • 37


    Citations of this article.


Abstract The problem of finding dominators in a flowgraph arises in many kinds of global code optimization and other settings. In 1979 Lengauer and Tarjan gave an almost-linear-time algorithm to find dominators. In 1985 Harel claimed a linear- time algorithm, but this algorithm was ...

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • PUI: 38428452
  • ISBN: 0-89871-558-X
  • SGR: 1842486903
  • SCOPUS: 2-s2.0-1842486903


  • Robert Endre Tarjan

  • Loukas Georgiadis

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free