Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness

DOI10.1016/S0020-0190(00)00054-5zbMath1339.05391OpenAlexW24382917MaRDI QIDQ294778

Samir Khuller

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000545?np=y

Mathematics Subject Classification ID

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

Related Items (3)

On the Complexity of Singly Connected Vertex Deletion ⋮ On the complexity of singly connected vertex deletion ⋮ On testing single connectedness in directed graphs and some related problems

Cites Work

• Determining uni-connectivity in directed graphs
• An \(O(|V|^2)\) algorithm for single connectedness

This page was built for publication: Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness