Distributed Computation of k-Vertex Connectivity Components in Large-scale Networks
In recent years,the k-vertex connected component(k-VCC)has become a key point in graph analysis due to its structural cohesion.k-VCCs are subgraphs whose remaining graphs are still connected after removing k-1 vertices.Existing algorithms for the k-VCC problem mainly focus on a single-computer environment.For this reason,in this paper,we design a distributed computational framework to mine all the k-VCCs in a given graph,and divide the problem of mining a large graph into multiple smaller subgraphs to perform the mining task concurrently.The effectiveness and efficiency of the proposed distributed approach is demonstrated experimentally.
万方数据
维普
