Simpler and faster vertex connectivity augmentation algorithms. (Extended abstract)

DOI10.1007/3-540-45253-2_26MaRDI QIDQ2753943zbMATH OpenFDO

Authors Tsan-sheng Hsu

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45253-2_26

Mathematics Subject Classification ID

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

Recommendations

• \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
• On the minimum augmentation of an -connected graph to a k-connected graph
• Directed vertex-connectivity augmentation
• A note on the vertex-connectivity augmentation problem
• scientific article; zbMATH DE number 2080256

Cited in

(15)

• Faster approximation algorithms for weighted triconnectivity augmentation problems
• Directed vertex-connectivity augmentation
• \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
• Tri-connectivity augmentation in trees
• scientific article; zbMATH DE number 1256717 (Why is no real title available?)
• scientific article; zbMATH DE number 1263261 (Why is no real title available?)
• Simpler sequential and parallel biconnectivity augmentation in trees
• Simpler and faster biconnectivity augmentation
• Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
• Tight bounds on vertex connectivity under vertex sampling
• A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
• Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
• Graph connectivity and its augmentation: Applications of MA orderings
• Smallest bipartite bridge-connectivity augmentation

This page was built for publication: Simpler and faster vertex connectivity augmentation algorithms. (Extended abstract)

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