2-Connectivity in Directed Graphs (Invited Talk)

DOI10.4230/LIPICS.ESA.2016.1zbMATH Open1395.05170OpenAlexW2529848018MaRDI QIDQ4606266FDOQ4606266

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

Publication date: 2 March 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6345/

Recommendations

• 2-connectivity in directed graphs: an experimental study
• 2-vertex connectivity in directed graphs
• 2-vertex connectivity in directed graphs
• 2-edge connectivity in directed graphs
• 2-Edge Connectivity in Directed Graphs
• On computing the 2-vertex-connected components of directed graphs
• On minimally 2-\(T\)-connected directed graphs
• Incremental strong connectivity and 2-connectivity in directed graphs
• Incremental 2-edge-connectivity in directed graphs
• On the (di)graphs with (directed) proper connection number two

zbMATH Keywords

graph algorithmsdominator trees2-edge and 2-vertex connectivity on directed graphs

Mathematics Subject Classification ID

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

Cited In (4)

• 2-Edge Connectivity in Directed Graphs
• On computing the 2-vertex-connected components of directed graphs
• Computing the 2-blocks of directed graphs
• On the (di)graphs with (directed) proper connection number two

This page was built for publication: 2-Connectivity in Directed Graphs (Invited Talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606266)