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
Parents
25
1–5 of 25
42
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 42
27
AT&T (United States)
Bedminster, United States
3 h-index
9 publications
446 citations
Princeton University
Princeton, United States
2 h-index
4 publications
140 citations

McGill University
Montreal, Canada
2 h-index
3 publications
199 citations

University of Victoria
Victoria, Canada
2 h-index
2 publications
92 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
348 citations

University of KwaZulu-Natal
Durban, South Africa
1 h-index
2 publications
112 citations

Indian Institute of Technology Kanpur
Kanpur, India
1 h-index
1 publications
14 citations
University of Copenhagen
Copenhagen, Denmark
1 h-index
3 publications
42 citations
1–8 of 27
3 publications · 148 citations
3
h-index
2 publications · 40 citations
2
h-index
2 publications · 92 citations
2
h-index
JGAA · 1 publications · 49 citations
1
h-index
SEN · 1 publications · 135 citations
1
h-index
1–5