| 任意无向图的最小R边连通扩充 |
| |
| 引用本文： | 孙立山,孙雨耕,杨山. 任意无向图的最小R边连通扩充[J]. 天津大学学报(自然科学与工程技术版), 1990, 0(4) |
| |
| 作者姓名： | 孙立山 孙雨耕 杨山 |
| |
| 作者单位： | 天津大学电力及自动化系(孙立山，孙雨耕)，天津大学电力及自动化系(杨山) |
| |
| 基金项目： | 国家科委自然科学基金项目 |
| |
| 摘 要： | 研究了以最少边集扩充一个任意无向图为R边连通图这一优化问题。给出了一个复杂度为O(|V|~5)的算法。利用该算法可最优地将所研究图形中任意两点达到所要求的边连通度。它发展了K边连通最优扩充的研究,从而使图的边连通扩充的研究在应用于网络结线的可靠性设计方面更具有实际意义。
|
| 关 键 词： | 无向图 最小扩充 R边连通 |
THE MINIMUM AUGMENTATION OF AN ARBITRARY UNDIRECTED GRAPH TO A R-EDGE-CONNECTED GRAPH |
| |
| SunLishan SunYugeng YangShan. THE MINIMUM AUGMENTATION OF AN ARBITRARY UNDIRECTED GRAPH TO A R-EDGE-CONNECTED GRAPH[J]. Journal of Tianjin University(Science and Technology), 1990, 0(4) |
| |
| Authors: | SunLishan SunYugeng YangShan |
| |
| Affiliation: | Department of Electrical Engineering and Automation |
| |
| Abstract: | This paper describes the optimization of constructing a R-edge-connected graph from any given undirected graph go by adding a minimum set of edge. An efficient algorithm with a complexity of O(|V|~5) is presented, this paper presents a new method for reliable network design with the most effective use of existing network. |
| |
| Keywords: | undirectrd graph minimum augmentation R-edge-connection |
| 本文献已被 CNKI 等数据库收录！ |
