3篇
您的检索式：作者名="Sun Yugeng"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | K-vertex-connectivity minimum augmentation for undirected unweighted graphs显示文摘For an undirected unweighted graph G0=(V0,E0) and a positive integer K, the K-vertex-connectivity minimum augmentation problem (K-VCMAP) is to find a minimum set of edges Emin such that the graph H0=(V0,E0∪Emin) is K-vertex-connected. Results in the literature have given polynomial time algorithms for K-VCMAP in several special cases such as where k≤3, or G0 is a tree. However, it still remains open whether or not there exist polynomial time algorithms for K-VCMAP for any graph G0 and any integer K. In this paper, we settle the problem by describing an efficient algorithm (KUCA) with time-complexity of O(K|V(G0)|5) for the K-VCMAP for any G0 and any positive integer K. | CAO Qiguo, WU Xue and SUN Yugeng(School of Electrical Automation and Energy Engineering, Tianjin University, Tianjin 300072, China) | 2003 | Progress in Natural Science:Materials International2003，13，6： | 3 |
| 2 | The minimum augmentation of any graph to a k-edge-connected graph显示文摘 | Cai Guorui Sun Yugeng | 1989 | Networks1989，19，： | 1 |
| 3 | The Minimum Augmentation of any Graph to a K-edge-connected Graph显示文摘 | Cai Guorui Sun Yugeng | 1989 | Networks1989，，19： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员