Improving biconnectivity approximation via local optimization

Authors:
Ka Wong Chong;Tak Wah Lam
Affiliations:
Department of Computer Science, University of HongKong, Pokfulam Road, Hong Kong;Department of Computer Science, University of HongKong, Pokfulam Road, Hong Kong
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

Algorithms for parallel k-vertex connectivity and sparse certificates

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On finding minimal 2-connected subgraphs

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximating matchings in parallel

Information Processing Letters
Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
Approximating biconnectivity in parallel

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Hi-index	0.00