And then the control method based on weighted graph was presented.
然后提出了一种基于加权无向图的控制方法。
In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
We present a novel perspective on characterizing the spectral correspondence between nodes of the weighted graph with application to image registration.
本文提出了一种新的基于谱图矩阵扰动分析的权图顶点对应的图像配准方法。
This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在MATLAB软件环境下对最短路径问题给出了一个简捷易懂的程序。
This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.
建立了配电网络重构的图的多划分模型，提出了基于图的谱划分的算法，用于求解大规模配电网络的馈线间重构问题。
This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.
建立了配电网络重构的图的多划分模型，提出了基于图的谱划分的算法，用于求解大规模配电网络的馈线间重构问题。
应用推荐