2-Edge Connectivity in Directed Graphs

DOI10.1145/2968448zbMath1451.05092OpenAlexW1880391707WikidataQ61609268 ScholiaQ61609268MaRDI QIDQ4962644

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

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2968448

zbMATH Keywords

dominatorsconnectivitydirected graphflow graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (8)

2-vertex connectivity in directed graphs ⋮ Computing Critical Nodes in Directed Graphs ⋮ 2-edge-twinless blocks ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Unnamed Item ⋮ Computing 2-twinless blocks

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