Independence free graphs and vertex connectivity augmentation
From MaRDI portal
Publication:1775893
Recommendations
Cites work
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A minimum 3-connectivity augmentation of a graph
- A note on the vertex-connectivity augmentation problem
- Augmentation Problems
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- Edge-connectivity augmentation problems
- Extremal graphs in connectivity augmentation
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
- How to make a graph four-connected
- scientific article; zbMATH DE number 1617267 (Why is no real title available?)
- scientific article; zbMATH DE number 2080256 (Why is no real title available?)
- Minimal edge-coverings of pairs of sets
- Non-separable detachments of graphs
- On Four-Connecting a Triconnected Graph
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the complexity of recognizing tough graphs
- On the optimal vertex-connectivity augmentation
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
- The minimum augmentation of any graph to aK-edge-connected graph
Cited in
(29)- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- Augmenting a tree to a k-arbor-connected graph with pagenumber k
- A 4+ approximation for k-connected subgraphs
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Property testing on \(k\)-vertex-connectivity of graphs
- Approximating node-connectivity augmentation problems
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Bounded length, 2-edge augmentation of geometric planar graphs
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- scientific article; zbMATH DE number 2080256 (Why is no real title available?)
- scientific article; zbMATH DE number 1757961 (Why is no real title available?)
- Structured connectivity augmentation
- Structured connectivity augmentation
- Approximating k-Connected m-Dominating Sets
- A survey of parameterized algorithms and the complexity of edge modification
- Augmenting the edge connectivity of planar straight line graphs to three
- Testing Eulerianity and connectivity in directed sparse graphs
- Connectivity augmentation in planar straight line graphs
- Globally linked pairs and cheapest globally rigid supergraphs
- The structure of minimum vertex cuts
- Parameterized algorithms for node connectivity augmentation problems
- The price of connectivity augmentation on planar graphs
- On triconnected and cubic plane graphs on given point sets
- Augmenting the connectivity of outerplanar graphs
- On shredders and vertex connectivity augmentation
- Augmenting the connectivity of geometric graphs
- Tight approximation algorithm for connectivity augmentation problems
- Local edge-connectivity augmentation in hypergraphs is NP-complete
This page was built for publication: Independence free graphs and vertex connectivity augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775893)
