Even, Shimon An algorithm for determining whether the connectivity of a graph is at least k. (English) Zbl 0311.05133 SIAM J. Comput. 4, 393-396 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 16 Documents MSC: 05C99 Graph theory 05C20 Directed graphs (digraphs), tournaments 68W99 Algorithms in computer science 90B10 Deterministic network models in operations research Software:Algorithm 447 PDFBibTeX XMLCite \textit{S. Even}, SIAM J. Comput. 4, 393--396 (1975; Zbl 0311.05133) Full Text: DOI Link