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
2011
Highly Cited
2011
We examine diffusive shock acceleration (DSA) of the pre-existing as well as freshly injected populations of non-thermal, cosmic… 
2011
2011
Relating optimized binary code and the source-level statements from which it was created can be challenging if an optimizing… 
Highly Cited
2010
Highly Cited
2007
Highly Cited
2007
We demonstrated control and detection of UV-induced 3-aminopropyltriethoxysilane (APTES) polarization using silicon nanowire… 
2000
2000
In the food industry there is a clear trend towards the production of speciality products with a high added value. Electro… 
1997
1997
AbstractSuppose that Y is a projective k-scheme with Cohen-Macaulay coordinate ring S. Let $ I\subset S $ be a homogeneous ideal… 
1994
1994
Logic verification tools are often used to verify a gate-level implementation of a digital system in terms of its functional… 
1972
1972
From a molecular orbital study of model systems we derive the electronic requirements for the Grob fragmentation. The necessary…