Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
A Distributed Algorithm for γ-Quasi-Clique Extractions in Massive Graphs
verfasst von : Arash Khosraviani, Mohsen Sharifi
Erschienen in: Innovative Computing Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we investigate the challenge of increasing the size of graphs for finding
γ
-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.