Dynamic Dominators and Low-High Orders in DAGs

Uses Software

SNAP
KONECT

Cites Work

Unnamed Item
Unnamed Item
On computing the 2-vertex-connected components of directed graphs
Finding dominators via disjoint set union
Finding strong bridges and strong articulation points in linear time
Certifying algorithms
A decomposition theorem and two algorithms for reticulation-visible networks
Testing flow graph reducibility
A uniform approach to semi-dynamic problems on digraphs
Fault tolerant reachability for directed graphs
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions
An Experimental Study of Dynamic Dominators
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
2-Vertex Connectivity in Directed Graphs
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
A fast algorithm for finding dominators in a flowgraph
Finding Dominators in Directed Graphs
Characterizations of Reducible Flow Graphs
Dominators in Linear Time
Incremental Low-High Orders of Directed Graphs and Applications.
Incremental 2-Edge-Connectivity in Directed Graphs
Mechanized Verification of Computing Dominators for Formalizing Compilers
Dominator Tree Certification and Divergent Spanning Trees
The Minset-Poset Approach to Representations of Graph Connectivity
Addendum to “Dominator Tree Certification and Divergent Spanning Trees”
Finding Dominators in Practice
Fault tolerant subgraph for single source reachability: generic and optimal
2-Edge Connectivity in Directed Graphs
Computing the 2-blocks of directed graphs

This page was built for publication: Dynamic Dominators and Low-High Orders in DAGs