GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS( Network Design, Control and Optimization)
Hiroshi Nagamochi · Journal of the Operations Research Society of Japan · 2004
This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.