{"id":"https://openalex.org/W1963605141","doi":"https://doi.org/10.1145/2339530.2339724","title":"Fast algorithms for maximal clique enumeration with limited memory","display_name":"Fast algorithms for maximal clique enumeration with limited memory","publication_year":2012,"publication_date":"2012-08-12","ids":{"openalex":"https://openalex.org/W1963605141","doi":"https://doi.org/10.1145/2339530.2339724","mag":"1963605141"},"language":"en","primary_location":{"id":"doi:10.1145/2339530.2339724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339530.2339724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016082884","display_name":"James Cheng","orcid":"https://orcid.org/0000-0001-6313-6288"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"James Cheng","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022377869","display_name":"Linhong Zhu","orcid":"https://orcid.org/0000-0001-8350-392X"},"institutions":[{"id":"https://openalex.org/I3005327000","display_name":"Institute for Infocomm Research","ror":"https://ror.org/053rfa017","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I3005327000","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Linhong Zhu","raw_affiliation_strings":["Institute for Infocomm Research, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Institute for Infocomm Research, Singapore, Singapore","institution_ids":["https://openalex.org/I3005327000"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074491217","display_name":"Yiping Ke","orcid":"https://orcid.org/0000-0001-9473-3202"},"institutions":[{"id":"https://openalex.org/I3004594783","display_name":"Institute of High Performance Computing","ror":"https://ror.org/02n0ejh50","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I3004594783","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Yiping Ke","raw_affiliation_strings":["Institute of High Performance Computing, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Institute of High Performance Computing, Singapore, Singapore","institution_ids":["https://openalex.org/I3004594783"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102141433","display_name":"Shumo Chu","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Shumo Chu","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016082884"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":6.5144,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.97206029,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1240","last_page":"1248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.1891999989748001,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.1891999989748001,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.1843000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.17759999632835388,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.8040608763694763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7268025875091553},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.645301103591919},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5650666952133179},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.544583797454834},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5104459524154663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4816547930240631},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4802834689617157},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.46162205934524536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.457058846950531},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.44532740116119385},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44224148988723755},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.43702417612075806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3809051215648651},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18947744369506836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12119749188423157},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11678406596183777},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10951447486877441},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09492364525794983}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8040608763694763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7268025875091553},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.645301103591919},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5650666952133179},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.544583797454834},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5104459524154663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4816547930240631},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4802834689617157},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.46162205934524536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.457058846950531},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.44532740116119385},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44224148988723755},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.43702417612075806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3809051215648651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18947744369506836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12119749188423157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11678406596183777},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10951447486877441},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09492364525794983},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2339530.2339724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339530.2339724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.700.635","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.700.635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isi.edu/%7Elinhong/Papers/kdd12.pdf","raw_type":"text"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/98958","is_oa":false,"landing_page_url":"http://hdl.handle.net/10220/12578","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1485742133","https://openalex.org/W1567562836","https://openalex.org/W1868111879","https://openalex.org/W1960686302","https://openalex.org/W1974959172","https://openalex.org/W1998341696","https://openalex.org/W2005234139","https://openalex.org/W2012720017","https://openalex.org/W2023536175","https://openalex.org/W2028902195","https://openalex.org/W2030088585","https://openalex.org/W2038142281","https://openalex.org/W2040420521","https://openalex.org/W2046270811","https://openalex.org/W2051658231","https://openalex.org/W2061901927","https://openalex.org/W2070593017","https://openalex.org/W2080925589","https://openalex.org/W2082603400","https://openalex.org/W2089417393","https://openalex.org/W2090200605","https://openalex.org/W2113513143","https://openalex.org/W2116007667","https://openalex.org/W2131804386","https://openalex.org/W2137709410","https://openalex.org/W2138660495","https://openalex.org/W2141555543","https://openalex.org/W2142599626","https://openalex.org/W2155821385","https://openalex.org/W2160429376","https://openalex.org/W2403629185","https://openalex.org/W2571329707","https://openalex.org/W3049667020","https://openalex.org/W4230870880","https://openalex.org/W6656430298"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W4300229885","https://openalex.org/W2891037262","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W1487885374","https://openalex.org/W2550802162","https://openalex.org/W4224326468"],"abstract_inverted_index":{"Maximal":[0],"clique":[1],"enumeration":[2],"(MCE)":[3],"is":[4,28,32],"a":[5,67,73],"long-standing":[6],"problem":[7,46],"in":[8,97],"graph":[9,27],"theory":[10],"and":[11,31],"has":[12],"numerous":[13],"important":[14],"applications.":[15],"Though":[16],"extensively":[17],"studied,":[18],"most":[19],"existing":[20],"algorithms":[21,94],"become":[22],"impractical":[23],"when":[24],"the":[25,45,58,84,90],"input":[26],"too":[29],"large":[30,49,98],"disk-resident.":[33],"We":[34,54,88],"first":[35],"propose":[36],"an":[37],"efficient":[38],"partition-based":[39],"algorithm":[40,80],"for":[41],"MCE":[42,65],"that":[43],"addresses":[44],"of":[47,61,64,92],"processing":[48],"graphs":[50],"with":[51],"limited":[52],"memory.":[53],"then":[55],"further":[56,82],"reduce":[57,83],"high":[59],"cost":[60,74],"CPU":[62],"computation":[63],"by":[66,95],"careful":[68],"nested":[69],"partition":[70],"based":[71],"on":[72],"model.":[75],"Finally,":[76],"we":[77],"parallelize":[78],"our":[79,93],"to":[81],"overall":[85],"running":[86],"time.":[87],"verified":[89],"efficiency":[91],"experiments":[96],"real-world":[99],"graphs.":[100]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}