Finding Dominators in Practice
From MaRDI portal
Publication:5301382
Recommendations
- Algorithms – ESA 2004
- Finding dominators revisited (extended abstract)
- Finding dominators via disjoint set union
- Contification using dominators
- An experimental study of dynamic dominators
- Dominators in Linear Time
- Computing dominators in parallel
- Generalized dominators
- Corrections to ``Finding dominators via disjoint set union
- Validating dominator trees for a fast, verified dominance test
Cited in
(22)- Computing dominators in parallel
- Generalized dominators for structured programs
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class
- Strong articulation points and strong bridges in large scale graphs
- Dominators, directed bipolar orders, and independent spanning trees
- Disjoint set forest digraph representation for an efficient dominator tree construction
- An experimental study of dynamic dominators
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Computing Frequency Dominators and Related Problems
- Finding dominators via disjoint set union
- Computing Critical Nodes in Directed Graphs
- Incremental low-high orders of directed graphs and applications
- Generalized dominators for structured programs
- Dynamic Dominators and Low-High Orders in DAGs
- Algorithms – ESA 2004
- Finding dominators revisited (extended abstract)
- Computing 2-twinless blocks
- Efficient computation of arbitrary control dependencies
- Computing dominators on a cube-connected machine
- Safe sequences via dominators in DAGs for path-covering problems
This page was built for publication: Finding Dominators in Practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301382)
