Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)

DOI10.1007/BFB0015432zbMath1512.68229MaRDI QIDQ6487973

Tsan-sheng Hsu

Publication date: 21 March 2023

Mathematics Subject Classification ID

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

Related Items (3)

An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Optimal augmentation for bipartite componentwise biconnectivity in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimum 3-connectivity augmentation of a graph
• Minimum block containing a given graph
• Finding a Smallest Augmentation to Biconnect a Graph
• Augmentation Problems
• Smallest Augmentations to Biconnect a Graph
• Dividing a Graph into Triconnected Components
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)