In this paper, we investigate the challenge of increasing the size of graphs for finding gamma-quasi-cliques. We propose an algorithm based on mapreduce programming model. In the proposed solution, we use some known t...
详细信息
ISBN:
(纸本)9783642273360;9783642273377
In this paper, we investigate the challenge of increasing the size of graphs for finding gamma-quasi-cliques. We propose an algorithm based on mapreduce programming model. In the proposed solution, we use some known techniques to prune unnecessary and inefficient parts of search space and divides the massive input graph into smaller parts. Then the data for processing each part is sent to a single computer. The evaluation shows that we can substantially reduce the time for large graphs and besides there is no limit for graph size in our algorithm.
暂无评论