Edge-connectivity augmentation problems

1987/08/01 by Toshimasa Watanabe, Akira Nakamura · 5 citations
Computer Science · #Interconnection Networks and Systems #Complexity and Algorithms in Graphs #Optimization and Search Problems

paper · doi:10.1016/0022-0000(87)90038-9

Cited by

• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• The Minimum Subgraph Complementation Problem
• Plane Strong Connectivity Augmentation
• The Price of Connectivity Augmentation on Planar Graphs
• Fixed-parameter algorithms for minimum cost edge-connectivity\n augmentation