In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
Broadcast networks can be expressed by a simple connected undirected graph.
将广播网络用简单连通的无向图表示。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
应用推荐