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

DOI10.1007/3-540-61332-3_150zbMath1529.68213OpenAlexW1547817493MaRDI QIDQ6184661

Ming-Yang Kao, Tsan-sheng Hsu

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
• Finding a Smallest Augmentation to Biconnect a Graph
• On Network Augmentation
• Optimal Mixed Graph Augmentation
• A Graph Theoretic Approach to Statistical Data Security
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems
• Smallest Augmentations to Biconnect a Graph

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