2-Connectivity in Directed Graphs: An Experimental Study

DOI10.1137/1.9781611973754.15zbMath1430.05125OpenAlexW2256693490MaRDI QIDQ5232536

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis, William di Luigi, Luigi Laura

Publication date: 12 September 2019

Published in: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973754.15

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (6)

On computing the 2-vertex-connected components of directed graphs ⋮ 2-vertex connectivity in directed graphs ⋮ 2-edge-twinless blocks ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Computing 2-twinless blocks

This page was built for publication: 2-Connectivity in Directed Graphs: An Experimental Study