{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T19:11:09Z","timestamp":1770577869728,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339724","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"1240-1248","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":111,"title":["Fast algorithms for maximal clique enumeration with limited memory"],"prefix":"10.1145","author":[{"given":"James","family":"Cheng","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Linhong","family":"Zhu","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research, Singapore, Singapore"}]},{"given":"Yiping","family":"Ke","sequence":"additional","affiliation":[{"name":"Institute of High Performance Computing, Singapore, Singapore"}]},{"given":"Shumo","family":"Chu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"International Conference on Research Trends in Science and Technology","author":"Abu-Khzam F. N.","year":"2005","unstructured":"F. N. Abu-Khzam , N. E. Baldwin , M. A. Langston , and N. F. Samatova . On the relative efficiency of maximal clique enumeration algorithms, with applications to high-throughput computational biology . In International Conference on Research Trends in Science and Technology , 2005 . F. N. Abu-Khzam, N. E. Baldwin, M. A. Langston, and N. F. Samatova. On the relative efficiency of maximal clique enumeration algorithms, with applications to high-throughput computational biology. In International Conference on Research Trends in Science and Technology, 2005."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(79)90014-5"},{"key":"e_1_3_2_2_6_1","volume-title":"The AAAI-04 Workshop on Agent Organizations: Theory and Practice","author":"Berry N. M.","year":"2004","unstructured":"N. M. Berry , T. H. Ko , T. Moy , J. Smrcka , J. Turnley , and B. Wu . Emergent clique formation in terrorist recruitment . In The AAAI-04 Workshop on Agent Organizations: Theory and Practice , 2004 . N. M. Berry, T. H. Ko, T. Moy, J. Smrcka, J. Turnley, and B. Wu. Emergent clique formation in terrorist recruitment. In The AAAI-04 Workshop on Agent Organizations: Theory and Practice, 2004."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2004.02.004"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.010"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382581"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00528-2_3"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88067-7_12"},{"key":"e_1_3_2_2_18_1","first-page":"403","volume-title":"ISAAC (1)","author":"Eppstein D.","year":"2010","unstructured":"D. Eppstein , M. L\u00f6ffler , and D. Strash . Listing all maximal cliques in sparse graphs in near-optimal time . In ISAAC (1) , pages 403 -- 414 , 2010 . D. Eppstein, M. L\u00f6ffler, and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In ISAAC (1), pages 403--414, 2010."},{"key":"e_1_3_2_2_19_1","first-page":"364","volume-title":"SEA","author":"Eppstein D.","year":"2011","unstructured":"D. Eppstein and D. Strash . Listing all maximal cliques in large sparse real-world graphs . In SEA , pages 364 -- 375 , 2011 . D. Eppstein and D. Strash. Listing all maximal cliques in large sparse real-world graphs. In SEA, pages 364--375, 2011."},{"key":"e_1_3_2_2_20_1","volume-title":"Social network analysis: Methods and applications","author":"Faust K.","year":"1995","unstructured":"K. Faust and S. Wasserman . Social network analysis: Methods and applications . Cambridge University Press , 1995 . K. Faust and S. Wasserman. Social network analysis: Methods and applications. Cambridge University Press, 1995."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658047"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2005469"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00286-3"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458288"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000008651.28952.b6"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11811305_67"},{"key":"e_1_3_2_2_32_1","volume-title":"Truss decomposition in massive networks. To appear in Proceedings of the Very Large Database Endowment","author":"Wang J.","year":"2012","unstructured":"J. Wang and J. Cheng . Truss decomposition in massive networks. To appear in Proceedings of the Very Large Database Endowment , 2012 . J. Wang and J. Cheng. Truss decomposition in massive networks. To appear in Proceedings of the Very Large Database Endowment, 2012."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.30"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China","acronym":"KDD '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:14Z","timestamp":1750239254000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":33,"alternative-id":["10.1145\/2339530.2339724","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339724","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}