Dominators in Linear Time
From MaRDI portal
Cited in
(25)- Two flow network simplification algorithms
- 2-vertex connectivity in directed graphs
- Sparse certificates for 2-connectivity in directed graphs
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- A simpler and more efficient algorithm for the next-to-shortest path problem
- Safety in s-t paths, trails and walks
- A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- A linear-time kernelization for the rooted k-leaf outbranching problem
- On computing the 2-vertex-connected components of directed graphs
- Strong articulation points and strong bridges in large scale graphs
- 2-vertex connectivity in directed graphs
- Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
- Finding dominators via disjoint set union
- Computing Critical Nodes in Directed Graphs
- Dynamic Dominators and Low-High Orders in DAGs
- Strong connectivity in directed graphs under failures, with applications
- Finding Dominators in Practice
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- Computing the 2-blocks of directed graphs
- Computing 2-twinless blocks
- On 2-strong connectivity orientations of mixed graphs and related problems
- Faster dynamic 2-edge connectivity in directed graphs
- Safe sequences via dominators in DAGs for path-covering problems
- Average case analysis of DJ graphs
This page was built for publication: Dominators in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268860)
