摘要
提出了一种适合大型公路交通网络的割集搜索算法CSA -CJ。该算法利用二进制数分割无向图的顶点集 ,通过对子图各顶点的关联集的运算产生相应的割集。
The paper proposed a method called CSA-CJ which is adapt to find cut sets of huge highway transportation network. The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
出处
《浙江交通职业技术学院学报》
CAS
2004年第1期13-16,共4页
Journal of Zhejiang Institute of Communications