On Finding a Smallest Augmentation to Biconnect a Graph

Authors:
Tsan-sheng Hsu;Vijaya Ramachandran
Affiliations:
-;-
Venue:
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Year:
1991

Citing 0
Cited 3

Biconnectivity approximations and graph carvings

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
A new approximation algorithm for the planar augmentation problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract