Biconnectivity approximations and graph carvings
- 1 March 1994
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 41 (2) , 214-235
- https://doi.org/10.1145/174652.174654
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- Approximation Algorithms for Graph AugmentationJournal of Algorithms, 1993
- A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graphAlgorithmica, 1992
- Augmenting Graphs to Meet Edge-Connectivity RequirementsSIAM Journal on Discrete Mathematics, 1992
- An application of submodular flowsLinear Algebra and its Applications, 1989
- Edge-connectivity augmentation problemsJournal of Computer and System Sciences, 1987
- On efficient parallel strong orientationInformation Processing Letters, 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- On the relationship between the biconnectivity augmentation and travelling salesman problemsTheoretical Computer Science, 1982
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981