2-vertex connectivity in directed graphs
From MaRDI portal
Publication:1640998
DOI10.1016/j.ic.2018.02.007zbMath1395.68209arXiv1409.6277OpenAlexW3043435921MaRDI QIDQ1640998
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis, Luigi Laura
Publication date: 14 June 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.6277
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (4)
2-edge-twinless blocks ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Unnamed Item ⋮ Computing 2-twinless blocks
Cites Work
- 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
- A linear-time algorithm for a special case of disjoint set union
- Maintaining bridge-connected and biconnected components on-line
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
- A fast algorithm for finding dominators in a flowgraph
- Finding Dominators in Directed Graphs
- Efficiency of a Good But Not Linear Set Union Algorithm
- Dominators in Linear Time
- Dominator Tree Certification and Divergent Spanning Trees
- The Minset-Poset Approach to Representations of Graph Connectivity
- 2-Edge Connectivity in Directed Graphs
- 2-Connectivity in Directed Graphs: An Experimental Study
- Computing the 2-blocks of directed graphs
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: 2-vertex connectivity in directed graphs
