Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.

最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。

youdao

The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。

youdao

The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。

youdao