Simpler and faster biconnectivity augmentation

DOI10.1016/S0196-6774(02)00223-7zbMath1030.68065OpenAlexW2052157833MaRDI QIDQ4806593

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

sortingdata structures

Mathematics Subject Classification ID

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

Related Items (7)

Smallest bipartite bridge-connectivity augmentation ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ The bridge-connectivity augmentation problem with a partition constraint ⋮ A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation ⋮ A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION

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