| 大型图的割集算法研究 |
| |
| 引用本文： | 胡阿龙,崔智涛.大型图的割集算法研究[J].武汉理工大学学报(交通科学与工程版),2005,29(5):794-796. |
| |
| 作者姓名： | 胡阿龙 崔智涛 |
| |
| 作者单位： | 西南交通大学交通运输学院,成都 610031 |
| |
| 摘 要： | 割集的概念与性质在网络问题的研究中受到广泛重视,但目前的割集搜索算法可操作性较差.提出了一种适合大型图的割集搜索算法CSA-CJ,利用二进制数分割无向图的顶点集,通过对子图各顶点的关联集的运算产生相应的割集.该算法简单适用,易于用计算机实现,尤其适合于大型图的割集搜索.
|
| 关 键 词： | 图论 割集算法 CSA-CJ算法 关联集 环和 |
| 收稿时间： | 2005-05-14 |
| 修稿时间： | 2005年5月14日 |
Research on Cut Set Algorithm of Large Graph |
| |
| Hu Along, Cui Zhitao.Research on Cut Set Algorithm of Large Graph[J].journal of wuhan university of technology(transportation science&engineering),2005,29(5):794-796. |
| |
| Authors: | Hu Along Cui Zhitao |
| |
| Abstract: | The concepts and characters of cut set are widely recognized, but the current methods of searching cut sets are not workable. The paper proposes a method called CSA-CJ which is adaptable to find cut sets of large highway transportation network. The algorithm uses a binary digit to divide the vertex set of a non-direction graph, and employs the incident sets of the vertices in the subgraph to produce opposite cut sets. This algorithm is easy to use by computer, and is especially adaptable to large figures. |
| |
| Keywords: | graph theory cut sets algorithm CSA-CJ algorithm incident set ring sum |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
