{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T16:57:24Z","timestamp":1758905844203,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954079"},{"type":"electronic","value":"9783030954086"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95408-6_9","type":"book-chapter","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:04:07Z","timestamp":1643587447000},"page":"113-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Clique Percolation Method: Memory Efficient Almost Exact Communities"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Baudin","sequence":"first","affiliation":[]},{"given":"Maximilien","family":"Danisch","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Kirgizov","sequence":"additional","affiliation":[]},{"given":"Cl\u00e9mence","family":"Magnien","sequence":"additional","affiliation":[]},{"given":"Marwan","family":"Ghanem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"issue":"9","key":"9_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Danisch, M., Balalau, O.D., Sozio, M.: Listing k-cliques in sparse real-world graphs. In: Champin, P.A., Gandon, F.L., Lalmas, M., Ipeirotis, P.G. (eds.) WWW, pp. 589\u2013598. ACM (2018)","DOI":"10.1145\/3178876.3186125"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 403\u2013414. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17517-6_36"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 364\u2013375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_31"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Fortunato, S., Castellano, C.: Community Structure in Graphs, pp. 490\u2013512. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-1800-9_33"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 345\u2013354. Association for Computing Machinery (1989)","DOI":"10.1145\/73007.73040"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/364099.364331","volume":"7","author":"BA Galler","year":"1964","unstructured":"Galler, B.A., Fisher, M.J.: An improved equivalence algorithm. Commun. ACM 7(5), 301\u2013303 (1964)","journal-title":"Commun. ACM"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gregori, E., Lenzini, L., Mainardi, S.: Parallel k-clique community detection on large-scale networks. IEEE Trans. Parallel Distrib. Syst. 24(8), 1651\u20131660 (2013). Implementation available at: https:\/\/sourceforge.net\/p\/cosparallel","DOI":"10.1109\/TPDS.2012.229"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kumpula, J.M., Kivel\u00e4, M., Kaski, K., Saram\u00e4ki, J.: Sequential algorithm for fast clique percolation. Phys. Rev. E 78(2), 026109 (2008). Implementation available at: https:\/\/github.com\/CxAalto\/scp","DOI":"10.1103\/PhysRevE.78.026109"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 61:1\u201361:29 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0537-7. https:\/\/hal.archives-ouvertes.fr\/hal-01665084","DOI":"10.1007\/s13278-018-0537-7"},{"key":"9_CR11","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"9_CR12","unstructured":"Li, R.H., Gao, S., Qin, L., Wang, G., Yang, W., Xu Yu, J.: Ordering heuristics for $$k$$-clique listing. In: PVLDB (2020)"},{"key":"9_CR13","unstructured":"McDaid, A.F., Greene, D., Hurley, N.: Normalized mutual information to evaluate overlapping community finding algorithms (2013). https:\/\/arxiv.org\/abs\/1110.2515"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005). Implementation available at: http:\/\/www.cfinder.org\/","DOI":"10.1038\/nature03607"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Reid, F., McDaid, A., Hurley, N.: Percolation computation in complex networks. In: 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 274\u2013281. IEEE (2012). Implementation available at: https:\/\/sites.google.com\/site\/cliqueperccomp\/home","DOI":"10.1109\/ASONAM.2012.54"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31(2), 245\u2013281 (1984)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2501654.2501657","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput. Surv. (CSUR) 45(4), 43 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95408-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:07:35Z","timestamp":1643587655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95408-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954079","9783030954086"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95408-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2021.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}