Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study
DOI10.1137/1.9781611975055.15zbMATH Open1430.68210OpenAlexW2781567902MaRDI QIDQ5232736FDOQ5232736
Authors: Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel 
Publication date: 12 September 2019
Published in: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975055.15
Recommendations
- 2-connectivity in directed graphs: an experimental study
- Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
- 2-Connectivity in Directed Graphs (Invited Talk)
- On computing the 2-vertex-connected components of directed graphs
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Connectivity (05C40)
Cited In (8)
- On computing the 2-vertex-connected components of directed graphs
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- 2-connectivity in directed graphs: an experimental study
- Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
- 2-edge-twinless blocks
- Computing 2-twinless blocks
- Strong connectivity in directed graphs under failures, with applications
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
This page was built for publication: Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232736)
