Please use this identifier to cite or link to this item:
Title: Fast algorithms for maximal clique enumeration with limited memory
Authors: Cheng, James
Zhu, Linhong
Ke, Yiping
Chu, Shumo
Issue Date: 2012
Source: Cheng, J., Zhu, L., Ke, Y., & Chu, S. (2012). Fast algorithms for maximal clique enumeration with limited memory. Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12, 1240-1248.
Abstract: Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has numerous important applications. Though extensively studied, most existing algorithms become impractical when the input graph is too large and is disk-resident. We first propose an efficient partition-based algorithm for MCE that addresses the problem of processing large graphs with limited memory. We then further reduce the high cost of CPU computation of MCE by a careful nested partition based on a cost model. Finally, we parallelize our algorithm to further reduce the overall running time. We verified the efficiency of our algorithms by experiments in large real-world graphs.
DOI: 10.1145/2339530.2339724
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Conference Papers

Citations 5

Updated on Mar 27, 2023

Page view(s) 10

Updated on Mar 31, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.