1) community detection algorithm
社团探寻算法
1.
After detecting the community structure of the network through the community detection algorithm which is based on k-means clustering,we find that there are three communities in the network,which correspond to the bubble flow,slug flow and churn flow respectively,and the nodes of the network that are connected tightly between two communities correspond to the transitional flow.
基于K均值聚类的社团探寻算法对该网络的社团结构进行了分析,发现该网络存在分别对应于泡状流、段塞流及混状流的三个社团,并且两个社团间联系紧密的点分别对应于相应的过渡流型。
2) Community algorithm
社团算法
3) cluster detection algorithm
团簇探测算法
4) Community Detecting
社团探测
5) 'Explorer' Literary League
"探求者"社团
6) Routing algorithm
寻径算法
1.
The routing algorithms on faulty hypercubes which may be disconnected and with their number of fault Nodes|F|≥2n-2 are studied in this paper.
首次研究了当|F|≥ 2n - 2 ,且可以不连通情形下超立方网络的容错寻径算法 ,并借助于图的同构概念 ,研究了Fibonac ci立方网络 ,改进的Fibonacci立方网络 ,以及网孔互连网络的容错寻径算法。
2.
Results The corresponding routing algorithm is given.
结果给出了相应的寻径算法。
补充资料：探寻
1.探索寻求。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条