Pages that link to "Item:Q3896499"
From MaRDI portal
The following pages link to A fast algorithm for finding dominators in a flowgraph (Q3896499):
Displaying 39 items.
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- A min-max relation in flowgraphs (Q324741) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- Doomed program points (Q633286) (← links)
- Generalized dominators (Q674182) (← links)
- Probabilistic verification of Boolean functions (Q685120) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- Optimal register allocation for SSA-form programs in polynomial time (Q844183) (← links)
- Combining tree partitioning, precedence, and incomparability constraints (Q1020493) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- Dynamic program slicing (Q1110308) (← links)
- Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- 2-vertex connectivity in directed graphs (Q1640998) (← links)
- Phylogenetic diversity and biodiversity indices on phylogenetic networks (Q1642832) (← links)
- Efficient static checker for tainted variable attacks (Q1651020) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions (Q2186498) (← links)
- Criticality: static profiling for real-time programs (Q2251412) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Encoding and constructing 1-nested phylogenetic networks with trinets (Q2375949) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Efficient Computation of Dominance in Component Systems (Short Paper) (Q3095251) (← links)
- Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (Q4602544) (← links)
- Mechanized Verification of Computing Dominators for Formalizing Compilers (Q4916051) (← links)
- Generalized dominators for structured programs (Q5030185) (← links)
- Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
- Computing 2-twinless blocks (Q5862677) (← links)
- Hybrid information flow control for low-level code (Q6041280) (← links)
- Efficient computation of arbitrary control dependencies (Q6165552) (← links)
- Computing under-approximations of multivalued decision diagrams (Q6535193) (← links)
- Counting edges in a dag (Q6550536) (← links)
