Skip to search formSkip to main contentSkip to account menu

Dominator (graph theory)

Known as: Postdominance, Dominator, Lengauer-Tarjan algorithm 
In computer science, in control flow graphs, a node d dominates a node n if every path from the entry node to n must go through d. Notationally, this… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Hexagonal h-BN/metal interfaces for different 3d ,4 d, and 5d metals are studied in terms of ab initio density functional theory… 
Highly Cited
2008
Highly Cited
2008
Sensor network applications are generally characterized by long idle durations and intermittent communication patterns. The… 
Highly Cited
2008
Highly Cited
2008
This paper models social distance as endogenous to the choices of individuals. I show how large numbers of socially heterogeneous… 
Highly Cited
2007
Highly Cited
2007
In the Himalaya and other active convergent orogens, linear relationships between thermochronometer sample age and elevation are… 
Highly Cited
2003
Highly Cited
2003
This paper presents new data on the sources of growth for the US economy over the period 1977-2000. Our principal innovation is… 
Highly Cited
2002
Highly Cited
2002
Drawing upon recent results on bandwagons in sequential voting, and by deriving analogous results for simultaneous voting, I… 
Highly Cited
1997
Highly Cited
1997
We present a detailed comparison of mass measurements for clusters of galaxies using ASCA and ROSAT X-ray data and constraints… 
Highly Cited
1994
Highly Cited
1994
In this paper we present techniques to find subsets of nodes of a flowgraph that satisfy the following property: A test set that… 
Highly Cited
1980
Highly Cited
1980
Two methods have been developed for analyzing MOS transients. One method is analytical and uses the quasi-static approximation…