| 无向树图的k点连通最小扩充 |
| |
| 引用本文： | 孙雨耕,贺昌科.无向树图的k点连通最小扩充[J].天津大学学报(自然科学与工程技术版),1993(4):1-9. |
| |
| 作者姓名： | 孙雨耕 贺昌科 |
| |
| 作者单位： | 天津大学电力及自动化系
(孙雨耕，贺昌科)，天津大学电力及自动化系(杨山) |
| |
| 摘 要： | 解决了以最少边集扩充一个任意无向树图为k点连通图这一优化问题,提出了一个计算复杂度为D(|V|~4)的算法。为进一步研究可靠网络的计算机辅助设计打下基础。
|
| 关 键 词： | 无向树图 最小扩充 k点连通 树图 |
THE MINIMUM AUGMENTATION OF A UNDIRECTED TREE GRAPH TO Ak-CONNECTED GRAPH |
| |
| Sun Yugeng He Changke Yang Shan.THE MINIMUM AUGMENTATION OF A UNDIRECTED TREE GRAPH TO Ak-CONNECTED GRAPH[J].Journal of Tianjin University(Science and Technology),1993(4):1-9. |
| |
| Authors: | Sun Yugeng He Changke Yang Shan |
| |
| Institution: | Dept. of Electrical Engineering and Automation |
| |
| Abstract: | The optimization problem of constructing k-connected graph from any undirected tree by adding a minimum set of edges is studied. An efficient algorithm with complexity of O(|V|~4) is presented. This algorithm constitutes a foundation for the computer aided design of reliable networks. |
| |
| Keywords: | undirected tree minimum augmentation k-connection |
| 本文献已被 CNKI 维普 等数据库收录！ |
