Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCheng, Jamesen
dc.contributor.authorZhu, Linhongen
dc.contributor.authorKe, Yipingen
dc.contributor.authorChu, Shumoen
dc.identifier.citationCheng, 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.en
dc.description.abstractMaximal 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.en
dc.titleFast algorithms for maximal clique enumeration with limited memoryen
dc.typeConference Paperen
dc.contributor.schoolSchool of Computer Engineeringen
dc.contributor.conferenceInternational conference on Knowledge discovery and data mining (18th : 2012 : Beijing, China)en
item.fulltextNo Fulltext-
Appears in Collections:SCSE Conference Papers

Citations 5

Updated on Mar 15, 2023

Page view(s) 10

Updated on Mar 26, 2023

Google ScholarTM




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