基于局部有限搜索的无向图近似最大团快速求解算法 (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy).
Details
The content you want is available to Zendy users.Already have an account? Click here. to sign in.
Details