| 一种任意无向图的R边连通扩充算法 |
| |
| 引用本文： | 刘惠敏,安瑛晖.一种任意无向图的R边连通扩充算法[J].河北工业科技,1993(1). |
| |
| 作者姓名： | 刘惠敏 安瑛晖 |
| |
| 作者单位： | 河北机电学院，河北省建设银行 |
| |
| 摘 要： | 本文提出了一个最小地扩充任意无向连通图为 R 边连通图的有效算法RMA。该算法采用了“先满足必要条件,再满足充要条件”的指导思想。对于一个任意无向连通图,首先将图中各点扩充到它所要求的最小度,然后检查它是否满足充要条件,如果不满足,则将该图分解,再根据最优程则,增加扩充边。将图合并,最后进行可行删除,解雇增广点,得到一个最小 R 边连通图。
|
| 关 键 词： | R 边连通图 可行删除 解雇增广 |
An Enhanced R-side Connected Graph as the Calculating Method of Arbitrary Non-directed Graph |
| |
| Liu Hueimin.An Enhanced R-side Connected Graph as the Calculating Method of Arbitrary Non-directed Graph[J].Hebei Journal of Industrial Science & Technology,1993(1). |
| |
| Authors: | Liu Hueimin |
| |
| Institution: | Liu Hueimin (Department of Electronic Engineering)
An Yinghui (The Bank of Building of Hebei Province) |
| |
| Abstract: | The paper gives out an effective calculating method RMA,which changes an arbi- trary non-directed graph into a R-side connected graph with minimum enhancement. A governing idea has been taken into consideration,that is“meeting the necessary condition first then the full condition”.For an arbitrary non-directed connected graph, first,make the points in it be enhanced to their minimum extent required.Then check it to see whether the full condition has been fulfilled.If not,decompose the graph and ac- cording to the optimization procedure,conbine graphs,discharge increased points to get a minimum R-side connected graph. |
| |
| Keywords: | R-side connected graph possible delete increasement discharge |
| 本文献已被 CNKI 等数据库收录！ |
|
