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

DOI10.1007/BFB0015432zbMATH Open1512.68229MaRDI QIDQ6487973FDOQ6487973

Authors: Tsan-sheng Hsu 

Publication date: 21 March 2023

Recommendations

• scientific article; zbMATH DE number 1670666
• Directed vertex-connectivity augmentation
• \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
• scientific article; zbMATH DE number 1617267
• scientific article; zbMATH DE number 1256642

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Dividing a Graph into Triconnected Components
• Finding a Smallest Augmentation to Biconnect a Graph
• Augmentation Problems
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum block containing a given graph
• Smallest Augmentations to Biconnect a Graph
• A minimum 3-connectivity augmentation of a graph

Cited In (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

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

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