Strong Connectivity in Directed Graphs under Failures, with Applications

DOI10.1137/1.9781611974782.123zbMath1410.68296arXiv1511.02913OpenAlexW4234397737MaRDI QIDQ4575869

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

Publication date: 16 July 2018

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (5)

Computing Critical Nodes in Directed Graphs ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ Unnamed Item ⋮ An efficient strongly connected components algorithm in the fault tolerant model

This page was built for publication: Strong Connectivity in Directed Graphs under Failures, with Applications