The following pages link to Dominators in Linear Time (Q4268860):
Displaying 20 items.
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- Average case analysis of DJ graphs (Q866551) (← links)
- Two flow network simplification algorithms (Q1045934) (← links)
- 2-vertex connectivity in directed graphs (Q1640998) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- A simpler and more efficient algorithm for the next-to-shortest path problem (Q1939658) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- A simplified algorithm computing all \(s-t\) bridges and articulation points (Q2235263) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- 2-Vertex Connectivity in Directed Graphs (Q3448819) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Computing Critical Nodes in Directed Graphs (Q4555541) (← links)
- Dynamic Dominators and Low-High Orders in DAGs (Q5075793) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
- Computing 2-twinless blocks (Q5862677) (← links)
