A probabilistic algorithm for vertex connectivity of graphs
From MaRDI portal
Publication:1167545
DOI10.1016/0020-0190(82)90046-1zbMath0491.68066OpenAlexW2001004241MaRDI QIDQ1167545
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90046-1
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Connectivity (05C40)
Related Items (3)
Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Improved algorithms for graph four-connectivity
Cites Work
This page was built for publication: A probabilistic algorithm for vertex connectivity of graphs
