| Article ID: | iaor20051913 |
| Country: | Japan |
| Volume: | 47 |
| Issue: | 4 |
| Start Page Number: | 199 |
| End Page Number: | 223 |
| Publication Date: | Dec 2004 |
| Journal: | Journal of the Operations Research Society of Japan |
| Authors: | Nagamochi Hiroshi |
| Keywords: | networks, networks: flow, optimization |
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.