Augmenting Undirected Node-Connectivity by One
From MaRDI portal
Publication:3094939
DOI10.1137/100787507zbMath1294.05107OpenAlexW2035591976MaRDI QIDQ3094939
Publication date: 27 October 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100787507
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (16)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Improved approximation algorithms for minimum cost node-connectivity augmentation problems ⋮ Approximating subset \(k\)-connectivity problems ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ Global and fixed-terminal cuts in digraphs ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs ⋮ Path-contractions, edge deletions and connectivity preservation ⋮ Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ On the cycle augmentation problem: hardness and approximation algorithms ⋮ A \(4+\epsilon\) approximation for \(k\)-connected subgraphs ⋮ Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Path-Contractions, Edge Deletions and Connectivity Preservation ⋮ Approximation algorithms for vertex-connectivity augmentation on the cycle ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
This page was built for publication: Augmenting Undirected Node-Connectivity by One
