Dominator Tree Construction

Dominator Tree Construction is a graph-theoretic algorithmic method in control-flow analysis that identifies, for each node in a control-flow graph, the set of dominators—defined as nodes that lie on all paths from the entry node—and organizes them into a hierarchical tree structure reflecting immediate dominance relations.

25

Publications

1.2K

Citations

42

Authors

27

Institutions

Publications per year

2017–2026

1

Authors

42

  1. JW
    Jeffery Westbrook

    AT&T (United States), United States

    3 publications · 186 citations

    3

    h-index

  2. AR
    Anne Rogers

    Princeton University, United States

    3 publications · 186 citations

    3

    h-index

  3. AL
    Adam L. Buchsbaum

    AT&T (United States), United States

    3 publications · 186 citations

    3

    h-index

  4. LG
    Loukas Georgiadis

    Princeton University, United States

    3 publications · 147 citations

    3

    h-index

  5. RE
    Robert E. Tarjan

    Princeton University, United States

    3 publications · 147 citations

    3

    h-index

1–5 of 42

Venues

  1. 3

    h-index

  2. Discrete Applied Mathematics

    2 publications · 40 citations

    2

    h-index

  3. Discrete Mathematics

    2 publications · 92 citations

    2

    h-index

  4. Journal of Graph Algorithms and Applications

    JGAA · 1 publications · 49 citations

    1

    h-index

  5. ACM SIGSOFT Software Engineering Notes

    SEN · 1 publications · 135 citations

    1

    h-index

1–5