Sign in
基于局部有限搜索的无向图近似最大团快速求解算法 (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy).
Maosheng Zhong
Chao Jiang
Lan Tao
Xiong He
Yuansheng Luo
Published in:
计算机科学 (2020)
Keyphrases
</>
search strategy
undirected graph
search space
search algorithm
optimal solution
computational complexity
np hard
probabilistic model
matching algorithm
objective function
simulated annealing
vertex cover
complex networks
information retrieval systems
worst case
upper bound
k means