A probabilistic algorithm for vertex connectivity of graphs

DOI10.1016/0020-0190(82)90046-1zbMath0491.68066MaRDI QIDQ1167545

S. Singh

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

zbMATH Keywords

complexity; network flow; sparse graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

90B10: Deterministic network models in operations research

05C40: Connectivity

Related Items

Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity