2-Edge Connectivity in Directed Graphs

DOI10.1137/1.9781611973730.132zbMath1371.05155arXiv1407.3041OpenAlexW2953345679MaRDI QIDQ5363073

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

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3041

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (6)

2-Vertex Connectivity in Directed Graphs ⋮ Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ 2-edge-twinless blocks ⋮ Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Computing 2-twinless blocks

This page was built for publication: 2-Edge Connectivity in Directed Graphs