Pages that link to "Item:Q3395044"

The following pages link to Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems (Q3395044):

Displaying 22 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)
• Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
• Finding dominators via disjoint set union (Q396673) (← links)
• Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
• 2-vertex connectivity in directed graphs (Q1640998) (← links)
• Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← 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)
• Succinct indices for path minimum, with applications (Q2362355) (← links)
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
• 2-Vertex Connectivity in Directed Graphs (Q3448819) (← links)
• Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
• Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
• Computing Critical Nodes in Directed Graphs (Q4555541) (← links)
• Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (Q4602544) (← 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)
• Efficient computation of arbitrary control dependencies (Q6165552) (← links)