Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

DOI10.1137/S0895480196303216zbMath1092.68076OpenAlexW2091333811MaRDI QIDQ5470763

Tsan-sheng Hsu, Ming-Yang Kao

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480196303216

zbMATH Keywords

biconnectivitydata securitybipartite graph augmentation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (2)

Smallest bipartite bridge-connectivity augmentation ⋮ The bridge-connectivity augmentation problem with a partition constraint

This page was built for publication: Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time