Using expander graphs to find vertex connectivity
From MaRDI portal
Publication:3455218
DOI10.1145/1183907.1183912zbMath1326.05074OpenAlexW2111332454MaRDI QIDQ3455218
Publication date: 4 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1183907.1183912
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (5)
On computing the 2-vertex-connected components of directed graphs ⋮ Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Optimal per-edge processing times in the semi-streaming model ⋮ Finding densest \(k\)-connected subgraphs ⋮ Unnamed Item
This page was built for publication: Using expander graphs to find vertex connectivity
