最小代价抗毁计算机通信网的拓扑设计，二分图法
Topological design of minimum cost survivable computer communication networks, Bipartite Graph Method
摘要：
一个好的计算机网络是很难被破坏的。期望计算机通信网络即使在一些链路或节点故障时也保持连接。由于通信链路是昂贵的，人们希望用更少的链路来实现这些目标。计算机通信网络是容错的，如果它的顶点之间有替代路径，不相交的路径越多，生存性越好。本文提出了一种利用二部图概念生成具有最佳链路数的k连通计算机通信网络的方法。
英文摘要：
A good computer network is hard to disrupt. It is desired that the computer communication network remains connected even when some of the links or nodes fail. Since the communication links are expensive, one wants to achieve these goals with fewer links. The computer communication network is fault tolerant if it has alternative paths between vertices, the more disjoint paths, the better is the survivability. This paper presents a method for generating k-connected computer communication network with optimal number of links using bipartite graph concept.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
