Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
From MaRDI portal
Publication:3587423
DOI10.1007/978-3-642-14165-2_62zbMath1288.05273OpenAlexW1951501494MaRDI QIDQ3587423
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_62
Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (13)
On computing the 2-vertex-connected components of directed graphs ⋮ Strong articulation points and strong bridges in large scale graphs ⋮ Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ 2-edge-twinless blocks ⋮ Finding dominators via disjoint set union ⋮ Finding strong bridges and strong articulation points in linear time ⋮ Join-reachability problems in directed graphs ⋮ Unnamed Item ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Computing the 2-blocks of directed graphs ⋮ Computing 2-twinless blocks
This page was built for publication: Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
