Finding the Vertex Connectivity of Graphs
From MaRDI portal
Publication:3891779
DOI10.1137/0209016zbMath0446.68053OpenAlexW2035435951MaRDI QIDQ3891779
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209016
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Finding maximum subgraphs with relatively large vertex connectivity, Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time, Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity, Rubber bands, convex embeddings and graph connectivity, An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs, Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments, On shredders and vertex connectivity augmentation, Certifying algorithms, A simple variant of node connectivity is NP-complete, An algorithm for finding all thek-components of a digraph, A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph, Approximating minimum cuts under insertions, A linear time algorithm for computing 3-edge-connected components in a multigraph, Unnamed Item, Computing vertex-disjoint paths in large graphs using MAOs, A polynomial time algorithm for cyclic vertex connectivity of cubic graphs, Tree-core and tree-coritivity of graphs, Improved algorithms for graph four-connectivity
