Optimal bi-level augmentation for selective! enhancing graph connectivity with applications

DOI10.1007/3-540-61332-3_150MaRDI QIDQ6184661zbMATH OpenOpenAlexFDO

Authors Tsan-sheng Hsu, Ming-Yang Kao

Publication date 29 January 2024

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

Full work available at URL https://doi.org/10.1007/3-540-61332-3_150

Mathematics Subject Classification ID

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

Recommendations

• A unifying augmentation algorithm for two-edge connectivity and biconnectivity
• scientific article; zbMATH DE number 2080257
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
• A Fast Algorithm for Optimally Increasing the Edge Connectivity

Cites work

• A Graph Theoretic Approach to Statistical Data Security
• Augmentation Problems
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Finding a Smallest Augmentation to Biconnect a Graph
• scientific article; zbMATH DE number 1555937 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
• On Network Augmentation
• Optimal Mixed Graph Augmentation
• Smallest Augmentations to Biconnect a Graph

This page was built for publication: Optimal bi-level augmentation for selective! enhancing graph connectivity with applications

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