{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T16:22:33Z","timestamp":1790698953155,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"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":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098031","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T14:35:54Z","timestamp":1501857354000},"page":"115-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Fast Enumeration of Large k-Plexes"],"prefix":"10.1145","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donatella","family":"Firmani","sequence":"additional","affiliation":[{"name":"Roma Tre University, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Caterina","family":"Mordente","sequence":"additional","affiliation":[{"name":"Be Think Solve Execute, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[{"name":"Roma Tre University, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Torlone","sequence":"additional","affiliation":[{"name":"Roma Tre University, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"http:\/\/lasagne-unifi.sourceforge.net. [Online; accessed Feb-2017].  http:\/\/lasagne-unifi.sourceforge.net. [Online; accessed Feb-2017]."},{"key":"e_1_3_2_2_2_1","unstructured":"http:\/\/patrignani.dia.uniroma3.it\/large-k-plexes. [Online; accessed Feb-2017].  http:\/\/patrignani.dia.uniroma3.it\/large-k-plexes. [Online; accessed Feb-2017]."},{"key":"e_1_3_2_2_3_1","volume-title":"Reverse search for enumeration. Discrete Applied Mathematics, 65(1--3):21--46","author":"Avis David","year":"1996","unstructured":"David Avis and Komei Fukuda . Reverse search for enumeration. Discrete Applied Mathematics, 65(1--3):21--46 , 1996 . David Avis and Komei Fukuda. Reverse search for enumeration. Discrete Applied Mathematics, 65(1--3):21--46, 1996."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"e_1_3_2_2_5_1","volume-title":"An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik . An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049 , 2003 . Vladimir Batagelj and Matjaz Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049, 2003."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746478"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.04.003"},{"key":"e_1_3_2_2_10_1","volume-title":"An improved upper bound on maximal clique listing via rectangular fast matrix multiplication. CoRR, abs\/1506.01082","author":"Comin Carlo","year":"2015","unstructured":"Carlo Comin and Romeo Rizzi . An improved upper bound on maximal clique listing via rectangular fast matrix multiplication. CoRR, abs\/1506.01082 , 2015 . Carlo Comin and Romeo Rizzi. An improved upper bound on maximal clique listing via rectangular fast matrix multiplication. CoRR, abs\/1506.01082, 2015."},{"key":"e_1_3_2_2_11_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016","author":"Conte Alessio","year":"2016","unstructured":"Alessio Conte , Roberto Grossi , Andrea Marino , and Luca Versari . Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 , July 11-15, 2016 , Rome, Italy, pages 148:1--148:15 , 2016. Alessio Conte, Roberto Grossi, Andrea Marino, and Luca Versari. Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pages 148:1--148:15, 2016."},{"key":"e_1_3_2_2_12_1","first-page":"173","volume-title":"Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016","author":"Conte Alessio","year":"2016","unstructured":"Alessio Conte , Roberto De Virgilio , Antonio Maccioni , Maurizio Patrignani , and Riccardo Torlone . Finding all maximal cliques in very large social networks . In Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016 , Bordeaux, France , March 15-16, 2016 , Bordeaux, France, March 15-16, 2016., pages 173 -- 184 , 2016. Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, and Riccardo Torlone. Finding all maximal cliques in very large social networks. In Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016., pages 173--184, 2016."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9338-2"},{"key":"e_1_3_2_2_17_1","first-page":"143","volume-title":"Clique Relaxation Models in Social Network Analysis","author":"Pattillo Jeffrey","year":"2012","unstructured":"Jeffrey Pattillo , Nataly Youssef , and Sergiy Butenko . Clique Relaxation Models in Social Network Analysis , pages 143 -- 162 . Springer New York , New York, NY , 2012 . Jeffrey Pattillo, Nataly Youssef, and Sergiy Butenko. Clique Relaxation Models in Social Network Analysis, pages 143--162. Springer New York, New York, NY, 2012."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_2_20_1","volume-title":"Introduction to graph theory","author":"West Douglas Brent","year":"2001","unstructured":"Douglas Brent West Introduction to graph theory , volume 2 . Prentice hall Upper Saddle River , 2001 . Douglas Brent West et al. Introduction to graph theory, volume 2. Prentice hall Upper Saddle River, 2001."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77018-3_47"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-016-0022-1"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","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 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:30:25Z","timestamp":1750203025000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":22,"alternative-id":["10.1145\/3097983.3098031","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098031","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}