A note on the vertex-connectivity augmentation problem

DOI10.1006/JCTB.1997.1786MaRDI QIDQ1386437zbMATH OpenOpenAlexFDO

Authors Tibor Jordán

Publication date 19 July 2000

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/227035e20120f1ec2f377e2d4f80ce544631adeb

zbMATH Keywords

polynomial algorithmvertex-connectivity augmentation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• On the optimal vertex-connectivity augmentation
• scientific article; zbMATH DE number 2080256
• Approximating Node-Connectivity Augmentation Problems
• Approximating node-connectivity augmentation problems
• Approximation algorithms for connectivity augmentation problems
• Approximation algorithms for vertex-connectivity augmentation on the cycle
• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
• Approximating connectivity augmentation problems
• Approximating connectivity augmentation problems
• Augmenting edge-connectivity between vertex subsets

Cites work

• scientific article; zbMATH DE number 1256717 (Why is no real title available?)
• Minimal edge-coverings of pairs of sets
• On the optimal vertex-connectivity augmentation

Cited in

(22)

• Extremal graphs in connectivity augmentation
• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
• Connectivity augmentation of graphs
• scientific article; zbMATH DE number 1617267 (Why is no real title available?)
• scientific article; zbMATH DE number 2080256 (Why is no real title available?)
• \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
• scientific article; zbMATH DE number 5535213 (Why is no real title available?)
• Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
• On shredders and vertex connectivity augmentation
• Structured connectivity augmentation
• Augmenting edge-connectivity between vertex subsets
• Approximating node-connectivity augmentation problems
• Independence free graphs and vertex connectivity augmentation
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements
• Graph connectivity and its augmentation: Applications of MA orderings
• scientific article; zbMATH DE number 1757961 (Why is no real title available?)
• scientific article; zbMATH DE number 2080985 (Why is no real title available?)
• Property testing on \(k\)-vertex-connectivity of graphs
• An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
• Primal-dual approach for directed vertex connectivity augmentation and generalizations
• scientific article; zbMATH DE number 1670666 (Why is no real title available?)
• NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

This page was built for publication: A note on the vertex-connectivity augmentation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386437)