Finding the Vertex Connectivity of Graphs
From MaRDI portal
Cited in
(20)- Rubber bands, convex embeddings and graph connectivity
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Computing vertex-disjoint paths in large graphs using MAOs
- Tree-core and tree-coritivity of graphs
- An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
- Finding maximum subgraphs with relatively large vertex connectivity
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- A simple variant of node connectivity is NP-complete
- An algorithm for finding all thek-components of a digraph
- Approximating minimum cuts under insertions
- Certifying algorithms
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Computing vertex-disjoint paths in large graphs using MAOs
- Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
- On the minimum number of inversions to make a digraph k-(arc-)strong
- Improved algorithms for graph four-connectivity
- On shredders and vertex connectivity augmentation
This page was built for publication: Finding the Vertex Connectivity of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3891779)
