Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)

DOI10.1007/978-3-642-10631-6_120MaRDI QIDQ3652304zbMATH OpenOpenAlexFDO

Authors Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Wei-Kuan Shih, Tsan-sheng Hsu, Ming-Yang Kao

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_120

zbMATH Keywords

linear time algorithmtwo-vertex connectivity augmentation problem

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Augmenting and preserving partition connectivity of a hypergraph
• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
• A note on the vertex-connectivity augmentation problem
• Two-Connected Augmentation Problems in Planar Graphs
• A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• scientific article; zbMATH DE number 1760036
• Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
• A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Cited in

(2)

• Graph orientations with set connectivity requirements
• The bridge-connectivity augmentation problem with a partition constraint

This page was built for publication: Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)

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