A fast algorithm for optimally increasing the edge-connectivity
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 698-707
- https://doi.org/10.1109/fscs.1990.89592
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Very Simple Methods for All Pairs Network Flow AnalysisSIAM Journal on Computing, 1990
- The minimum augmentation of any graph to a K‐edge‐connected graphNetworks, 1989
- A Graph Theoretic Approach to Statistical Data SecuritySIAM Journal on Computing, 1988
- Optimal Mixed Graph AugmentationSIAM Journal on Computing, 1987
- The minimum augmentation of a directed tree to a k‐edge‐connected directed graphNetworks, 1986
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graphCybernetics and Systems Analysis, 1986
- Connectivity and edge-disjoint spanning treesInformation Processing Letters, 1983
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- Augmentation ProblemsSIAM Journal on Computing, 1976
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975