Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph

DOI10.1007/978-3-642-23719-5_2zbMath1347.68368OpenAlexW4247251578MaRDI QIDQ3092212

Loukas Georgiadis

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_2

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

On computing the 2-vertex-connected components of directed graphs ⋮ Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ Finding dominators via disjoint set union ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Computing the 2-blocks of directed graphs

This page was built for publication: Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph