Computing Vertex Connectivity: New Bounds from Old Techniques
From MaRDI portal
Publication:4943077
Recommendations
- On computing the connectivities of graphs and digraphs
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- Old and new results on algebraic connectivity of graphs
- Tight bounds on vertex connectivity under vertex sampling
- A new measure of graph connectivity
- Lower bounds on the vertex-connectivity of digraphs and graphs
- scientific article; zbMATH DE number 4025476
Cited in
(27)- A probabilistic estimator for the vertex deletion problem
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Characterizing and recognizing 4-map graphs
- Minimum \(k\)-critical bipartite graphs
- On the robustness of a synchronized multi-robot system
- Finding densest \(k\)-connected subgraphs
- Tree-core and tree-coritivity of graphs
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- On element-connectivity preserving graph simplification
- Using expander graphs to find vertex connectivity
- Tight Bounds on Vertex Connectivity Under Sampling
- Dynamic programming for graphs on surfaces
- Cycle-connected mixed graphs and related problems
- Cycle-connected mixed graphs and related problems
- Separator-based data reduction for signed graph balancing
- Tight conditional lower bounds for vertex connectivity problems
- Finding a small vertex cut on distributed networks
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
- Vertex connectivity in poly-logarithmic max-flows
- Graph connectivity and its augmentation: Applications of MA orderings
- Faster algorithms for rooted connectivity in directed graphs
- Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity
- Some recent progress and applications in graph minor theory
- On shredders and vertex connectivity augmentation
- Graph connectivity, partial words, and a theorem of Fine and Wilf
This page was built for publication: Computing Vertex Connectivity: New Bounds from Old Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943077)
