GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS( Network Design, Control and Optimization)
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS( Network Design, Control and Optimization)
复制标题
DOI：
10.15807/jorsj.47.199
复制
发表时间：
2004-12
影响因子：
--
通讯作者：
H. Nagamochi
中科院分区：
文献类型：
--
作者：
H. Nagamochi
本文综述了网络连通性问题（如极值集问题、仙人掌表示问题、边连通性扩充问题和源定位问题）的图论算法的最新进展。特别是，我们表明，这些问题的有效算法可以设计基于最大邻接排序。
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 aug- mentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.