1) Graph Partition
图的划分
1.
Firstly Chameleon algorithm is discussed detailedly,including:Chameleon s fundamental idea,G_k graph,graph partition,how to compute similarity,hierarchical merging,and so on.
首先详细讨论了Chameleon算法,包括:Chameleon算法的基本思想、Gk图、图的划分、近似度的计算、层次合并等,然后给出了一个实现Chameleon算法的部分代码。
2.
Shi and Malik converted image segmentation into graph partitioning problem and proposed the normalized cut criterion.
Shi和Malik将图像分割转化为图的划分问题,提出了归一化割准则,这种分割方法没有把局部特征和一致性度量作为解决问题的关键,而是着重于提取整幅图像的特征,因此取得了较好的分割结果。
2) Graph partitioning
图的划分
3) 2-way graph partitioning
图的二划分
1.
Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling;
均匀设计抽样混合遗传算法求解图的二划分问题
2.
Solving 2-way graph partitioning problem using genetic algorithm based on Latin hypercube sampling
拉丁超立方体抽样遗传算法求解图的二划分问题
3.
Solving the 2-way graph partitioning problem using a genetic algorithm based on randomized uniform design
随机化均匀设计混合遗传算法求解图的二划分问题
4) Unbalanced partitioning
非均衡的图划分
5) the vertices partition number of a graph
图的顶点划分数
6) graph partitioning problem
图的划分问题
1.
The graph partitioning problem(GPP)is one of the typical NP-Hard problems with extensively wide applications.
图的划分问题(GPP)是具有广泛应用背景的典型NP-难解问题,高效启发式算法一直是该领域的研究热点。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条