2-connectivity in directed graphs: an experimental study

DOI10.1137/1.9781611973754.15MaRDI QIDQ5232536zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study
• 2-Connectivity in Directed Graphs (Invited Talk)
• 2-edge connectivity in directed graphs
• 2-Edge Connectivity in Directed Graphs
• 2-vertex connectivity in directed graphs

Cited in

(11)

• 2-vertex connectivity in directed graphs
• Sparse certificates for 2-connectivity in directed graphs
• 2-edge-twinless blocks
• On computing the 2-vertex-connected components of directed graphs
• 2-Connectivity in Directed Graphs (Invited Talk)
• 2-Edge Connectivity in Directed Graphs
• Strong connectivity in directed graphs under failures, with applications
• Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study
• Computing the 2-blocks of directed graphs
• Computing 2-twinless blocks
• On maximal k-edge-connected subgraphs of undirected graphs

This page was built for publication: 2-connectivity 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 Q5232536)