{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T17:37:01Z","timestamp":1786210621647,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T00:00:00Z","timestamp":1439164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-1320231"],"award-info":[{"award-number":["CCF-1320231"]}]},{"name":"NSF","award":["IIS-0964473"],"award-info":[{"award-number":["IIS-0964473"]}]},{"name":"NSF","award":["CNS-1228598"],"award-info":[{"award-number":["CNS-1228598"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,10]]},"DOI":"10.1145\/2783258.2783385","type":"proceedings-article","created":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T15:38:27Z","timestamp":1438961907000},"page":"815-824","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":108,"title":["Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling"],"prefix":"10.1145","author":[{"given":"Michael","family":"Mitzenmacher","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Pachocki","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Peng","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Tsourakakis","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shen Chen","family":"Xu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,8,10]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"http:\/\/www.avglab.com\/soft\/hipr.tar.  http:\/\/www.avglab.com\/soft\/hipr.tar."},{"key":"e_1_3_2_2_2_1","unstructured":"http:\/\/snap.stanford.edu\/data\/index.html.  http:\/\/snap.stanford.edu\/data\/index.html."},{"key":"e_1_3_2_2_3_1","unstructured":"http:\/\/grouplens.org\/datasets.  http:\/\/grouplens.org\/datasets."},{"key":"e_1_3_2_2_4_1","unstructured":"http:\/\/research.nii.ac.jp\/~uno\/codes.htm.  http:\/\/research.nii.ac.jp\/~uno\/codes.htm."},{"key":"e_1_3_2_2_5_1","unstructured":"Large Near-Clique Detection. http:\/\/tinyurl.com\/o6y33g9.  Large Near-Clique Detection. http:\/\/tinyurl.com\/o6y33g9."},{"key":"e_1_3_2_2_6_1","volume-title":"LATIN","author":"Abello J.","year":"2002","unstructured":"J. Abello , M. G. C. Resende , and S. Sudarsky . Massive quasi-clique detection . In LATIN , 2002 . J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, 2002."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_2_8_1","first-page":"279","volume-title":"SODA","author":"Andoni A.","year":"2014","unstructured":"A. Andoni , A. Gupta , and R. Krauthgamer . Towards (1+ \u03b5)-approximate flow sparsifiers . In SODA , pages 279 -- 293 . SIAM , 2014 . A. Andoni, A. Gupta, and R. Krauthgamer. Towards (1+ \u03b5)-approximate flow sparsifiers. In SODA, pages 279--293. SIAM, 2014."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_3_2_2_11_1","volume-title":"BMC bioinformatics","author":"Bader G. D.","year":"2003","unstructured":"G. D. Bader and C. W. Hogue . An automated method for finding molecular complexes in large protein interaction networks . In BMC bioinformatics , 2003 . G. D. Bader and C. W. Hogue. An automated method for finding molecular complexes in large protein interaction networks. In BMC bioinformatics, 2003."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_3_2_2_14_1","volume-title":"Arxiv, arXiv.cs\/0310049","author":"Batagelj V.","year":"2003","unstructured":"V. Batagelj and M. Zaversnik . An o(m) algorithm for cores decomposition of networks . In Arxiv, arXiv.cs\/0310049 , 2003 . V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. In Arxiv, arXiv.cs\/0310049, 2003."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009180"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90121-X"},{"key":"e_1_3_2_2_27_1","volume-title":"ISAAC","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 , 2010 . D. Eppstein, M. L\u00f6ffler, and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In ISAAC, 2010."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_2_29_1","volume-title":"ArXiv arXiv:1403.0734","author":"Finocchi I.","year":"2014","unstructured":"I. Finocchi , M. Finocchi , and E. G. Fusco . Counting small cliques in mapreduce . In ArXiv arXiv:1403.0734 , 2014 . I. Finocchi, M. Finocchi, and E. G. Fusco. Counting small cliques in mapreduce. In ArXiv arXiv:1403.0734, 2014."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_2_32_1","first-page":"721","volume-title":"VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering large dense subgraphs in massive graphs . In VLDB , pages 721 -- 732 , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721--732, 2005."},{"key":"e_1_3_2_2_33_1","volume-title":"UC Berkeley","author":"Goldberg A. V.","year":"1984","unstructured":"A. V. Goldberg . Finding a maximum density subgraph. Tech. report , UC Berkeley , 1984 . A. V. Goldberg. Finding a maximum density subgraph. Tech. report, UC Berkeley, 1984."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/548182"},{"key":"e_1_3_2_2_38_1","volume-title":"Analyzing the structure of large graphs, manuscript","author":"Kannan R.","year":"1999","unstructured":"R. Kannan and V. Vinay . Analyzing the structure of large graphs, manuscript , 1999 . R. Kannan and V. Vinay. Analyzing the structure of large graphs, manuscript, 1999."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_2_40_1","unstructured":"D. E. Knuth. Seminumerical algorithms. 2007.  D. E. Knuth. Seminumerical algorithms. 2007."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806698"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.28"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189-2"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109645"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00245"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9238-3"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"}],"event":{"name":"KDD '15: The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Sydney NSW Australia","acronym":"KDD '15","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 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783258.2783385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:23Z","timestamp":1750223243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,10]]},"references-count":59,"alternative-id":["10.1145\/2783258.2783385","10.1145\/2783258"],"URL":"https:\/\/doi.org\/10.1145\/2783258.2783385","relation":{},"subject":[],"published":{"date-parts":[[2015,8,10]]},"assertion":[{"value":"2015-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}