A fast algorithm for finding dominators in a flowgraph
From MaRDI portal
Cited in
(41)- Combining tree partitioning, precedence, and incomparability constraints
- An approach for extracting a small unsatisfiable core
- A linear-time algorithm for a special case of disjoint set union
- Efficient symbolic analysis of programs
- Dynamic program slicing
- Efficient parallel algorithms for path problems in directed graphs
- A uniform approach to semi-dynamic problems on digraphs
- 2-vertex connectivity in directed graphs
- Phylogenetic diversity and biodiversity indices on phylogenetic networks
- Efficient static checker for tainted variable attacks
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
- Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions
- Criticality: static profiling for real-time programs
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Strong articulation points and strong bridges in large scale graphs
- Efficient Computation of Dominance in Component Systems (Short Paper)
- A min-max relation in flowgraphs
- Finding dominators via disjoint set union
- Fault-tolerant subgraph for single-source reachability: general and optimal
- Mechanized verification of computing dominators for formalizing compilers
- Generalized dominators for structured programs
- Dynamic Dominators and Low-High Orders in DAGs
- Sparse weight tolerant subgraph for single source shortest path
- Strong connectivity in directed graphs under failures, with applications
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- Computing the 2-blocks of directed graphs
- Computing 2-twinless blocks
- Hybrid information flow control for low-level code
- An efficient customized clock allocation algorithm for a class of timed automata
- Efficient computation of arbitrary control dependencies
- On 2-strong connectivity orientations of mixed graphs and related problems
- Doomed program points
- Computing under-approximations of multivalued decision diagrams
- Counting edges in a dag
- Generalized dominators
- Probabilistic verification of Boolean functions
- A decomposition theorem and two algorithms for reticulation-visible networks
- Optimal register allocation for SSA-form programs in polynomial time
This page was built for publication: A fast algorithm for finding dominators in a flowgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3896499)
