Simpler and faster biconnectivity augmentation

DOI10.1016/S0196-6774(02)00223-7MaRDI QIDQ4806593zbMATH OpenOpenAlexFDO

Authors Tsan-sheng Hsu

Publication date 14 May 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(02)00223-7

zbMATH Keywords

data structuressorting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Simpler sequential and parallel biconnectivity augmentation in trees
• Planar biconnectivity augmentation with fixed embedding
• Improved data structures for fully dynamic biconnectivity
• Improved Data Structures for Fully Dynamic Biconnectivity
• Edge connectivity augmentation in near-linear time
• Towards more precise parallel biconnectivity approximation
• scientific article; zbMATH DE number 1670666
• scientific article; zbMATH DE number 871896
• A unifying augmentation algorithm for two-edge connectivity and biconnectivity
• An Efficient Parallel Biconnectivity Algorithm

Cited in

(9)

• Robustness and strong attack tolerance of low-diameter networks
• Finding a Smallest Augmentation to Biconnect a Graph
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• Smallest bipartite bridge-connectivity augmentation
• The bridge-connectivity augmentation problem with a partition constraint
• Simpler sequential and parallel biconnectivity augmentation in trees
• A unified framework for bi(tri)connectivity and chordal augmentation
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
• Augmenting the edge connectivity of planar straight line graphs to three

This page was built for publication: Simpler and faster biconnectivity augmentation

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