Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study

DOI10.1137/1.9781611975055.15zbMath1430.68210OpenAlexW2781567902MaRDI QIDQ5232736

Nikos Parotsidis, Nilakantha Paudel, Giuseppe F. Italiano, Aikaterini Karanasiou, Loukas Georgiadis

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

2-edge-twinless blocks ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Computing 2-twinless blocks

This page was built for publication: Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study