{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:52:58Z","timestamp":1767707578159,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s41019-017-0033-5","type":"journal-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T02:22:22Z","timestamp":1486434142000},"page":"219-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Maximal Clique Enumeration Over Graph Data"],"prefix":"10.1007","volume":"1","author":[{"given":"Boyi","family":"Hou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9383-9507","authenticated-orcid":false,"given":"Zhuo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Suo","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Zhanhuai","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zachary G.","family":"Ives","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,7]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu EA (1973) The enumeration of maximal cliques of large graphs. SIAM J Comput 2(1):1\u20136","journal-title":"SIAM J Comput"},{"doi-asserted-by":"crossref","unstructured":"Bader DA, Madduri K (2005) Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In: In Proceedings of 12th international conference on high performance computing, pp 465\u2013476","key":"33_CR2","DOI":"10.1007\/11602569_48"},{"unstructured":"Bader DA, Madduri K (2006) Gtgraph: a synthetic graph generator suite, pp 1\u20134. http:\/\/www.cse.psu.edu\/~madduri\/software\/GTgraph\/","key":"33_CR3"},{"issue":"9","key":"33_CR4","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"1","key":"33_CR5","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1):564\u2013568","journal-title":"Theor Comput Sci"},{"issue":"1\u20133","key":"33_CR6","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1\u20133):564\u2013568","journal-title":"Theor Comput Sci"},{"doi-asserted-by":"crossref","unstructured":"Chen Q, Fang C, Wang Z, Suo B, Li Z, lves ZG (2016) Parallelizing maximal clique enumeration over graph data. In: DASFAA, pp 249\u2013264","key":"33_CR7","DOI":"10.1007\/978-3-319-32049-6_16"},{"doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Fu AW-C, Yu JX, Zhu L (2011) Finding maximal cliques in massive networks. ACM Trans. Datab. Syst. 36(4):1\u201334","key":"33_CR8","DOI":"10.1145\/2043652.2043654"},{"doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Fu AW, Zhu L (2010) Finding maximal cliques in massive networks by h*-graph. In: SIGMOD, pp 447\u2013458","key":"33_CR9","DOI":"10.1145\/1807167.1807217"},{"doi-asserted-by":"crossref","unstructured":"Cheng J, Zhu L, Chu YKS (2012) Fast algorithms for maximal clique enumeration with limited memory. In: KDD, pp 1240\u20131248","key":"33_CR10","DOI":"10.1145\/2339530.2339724"},{"issue":"1","key":"33_CR11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14(1):210\u2013223","journal-title":"SIAM J Comput"},{"issue":"4","key":"33_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen J (2009) Graph twiddling in a mapreduce world. Comput Sci Eng 11(4):29\u201341","journal-title":"Comput Sci Eng"},{"doi-asserted-by":"crossref","unstructured":"Du N, Wu B, Xu LT, Wang B, Pei X (2006) A parallel algorithm for enumerating all maximal cliques in complex network. In: ICDM workshops, pp 320\u2013324","key":"33_CR13","DOI":"10.1109\/ICDMW.2006.17"},{"doi-asserted-by":"crossref","unstructured":"Eppstein D, L\u00f6ffler M, Strash D (2010) Listing all maximal cliques in sparse graphs in near-optimal time. In: ISAAC(1), pp 403\u2013414","key":"33_CR14","DOI":"10.1007\/978-3-642-17517-6_36"},{"doi-asserted-by":"crossref","unstructured":"Eppstein D, Strash D (2011) Listing all maximal cliques in large sparse real-world graphs. In: 10th International symposium on experimental algorithms, pp 364\u2013375","key":"33_CR15","DOI":"10.1007\/978-3-642-20662-7_31"},{"unstructured":"GP Project: efficient maximal clique and k-plex detection over graph data. http:\/\/www.wowbigdata.cn\/gp\/clique.html","key":"33_CR16"},{"unstructured":"Hadoop: an open-source implementation of mapreduce. http:\/\/hadoop.apache.org\/","key":"33_CR17"},{"unstructured":"Hanneman R (2005) Introduction to social network methods, chapter 11: cliques. http:\/\/faculty.ucr.edu\/~hanneman\/nettext\/","key":"33_CR18"},{"key":"33_CR19","first-page":"59","volume-title":"Federation over the web, volume 3847 of lecture notes in computer science","author":"M Haraguchi","year":"2006","unstructured":"Haraguchi M, Okubo Y (2006) A method for pinpoint clustering of web pages with pseudo-clique search. In: Jantke K, Lunzer A, Spyratos N, Tanaka Y (eds) Federation over the web, volume 3847 of lecture notes in computer science. Springer, Berlin, pp 59\u201378"},{"doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp 1311\u20131322","key":"33_CR20","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"33_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1460797.1460799","volume":"2","author":"DX Jiang","year":"2009","unstructured":"Jiang DX, Pei J (2009) Mining frequent cross-graph quasi-cliques. TKDE 2(4):1\u201342","journal-title":"TKDE"},{"doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: WWW, pp 695\u2013704","key":"33_CR22","DOI":"10.1145\/1367497.1367591"},{"doi-asserted-by":"crossref","unstructured":"Lu L, Gu Y, Grossman R (2010) dmaximalcliques: A distributed algorithm for enumerating all maximal cliques and maximal clique distribution. In: IEEE international conference on data mining workshops, pp 1320\u20131327","key":"33_CR23","DOI":"10.1109\/ICDMW.2010.13"},{"doi-asserted-by":"crossref","unstructured":"Makino K, Uno T (2004) New algorithms for enumerating all maximal cliques. In: SWAT, lecture notes in computer science, vol 3111, pp 260\u2013272","key":"33_CR24","DOI":"10.1007\/978-3-540-27810-8_23"},{"doi-asserted-by":"crossref","unstructured":"Modani N, Dey K (2008) Large maximal cliques enumeration in sparse graphs. In: CIKM, pp 1377\u20131378","key":"33_CR25","DOI":"10.1145\/1458082.1458288"},{"doi-asserted-by":"crossref","unstructured":"On B-W, Elmacioglu E, Lee D, Kang J, Pei J (2006) Improving grouped-entity resolution using quasi-cliques. In: ICDM, pp 1008\u20131015","key":"33_CR26","DOI":"10.1109\/ICDM.2006.85"},{"doi-asserted-by":"crossref","unstructured":"Pavlopoulos GA, Secrier M, Moschopoulos CN, Soldatos TG, Kossida S, Aertes J, Schneider R, Bagos PG (2011) Using graph theory to analyze biological networks. BioData Min 4:10","key":"33_CR27","DOI":"10.1186\/1756-0381-4-10"},{"unstructured":"Quick Cliques: quickly compute all maximal cliques in sparse graphs. https:\/\/github.com\/darrenstrash\/quick-cliques","key":"33_CR28"},{"unstructured":"Real graph datasets. http:\/\/snap.stanford.edu\/data\/","key":"33_CR29"},{"doi-asserted-by":"crossref","unstructured":"Rossi RA, Gleich DF, Gebremedhin AH, Patwary MMA (2014) Fast maximum clique algorithms for large graphs. In: WWW, pp 365\u2013366","key":"33_CR30","DOI":"10.1145\/2567948.2577283"},{"issue":"5","key":"33_CR31","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/14100018X","volume":"37","author":"RA Rossi","year":"2015","unstructured":"Rossi RA, Gleich DF, Gebremedhin AH (2015) Parallel maximum clique algorithms with applications to network analysis. SIAM J Sci Comput 37(5):589\u2013616","journal-title":"SIAM J Sci Comput"},{"issue":"4","key":"33_CR32","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt MC, Samatova NF, Thomas K, Park BH (2009) A scalable, parallel algorithm for maximal clique enumeration. J Parallel Distrib Comput 69(4):417\u2013428","journal-title":"J Parallel Distrib Comput"},{"key":"33_CR33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/B:COAP.0000008651.28952.b6","volume":"2","author":"V Stix","year":"2004","unstructured":"Stix V (2004) Finding all maximal cliques in dynamic graphs. Comput Optim Appl 2:173\u2013186","journal-title":"Comput Optim Appl"},{"issue":"1","key":"33_CR34","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comput Sci 363(1):28\u201342","journal-title":"Theor Comput Sci"},{"doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In: KDD, pp 104\u2013112","key":"33_CR35","DOI":"10.1145\/2487575.2487645"},{"issue":"3","key":"33_CR36","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama S, Ide M, Shirakawa I (1977) A new algorithm for generating all the maximal independent sets. SIAM J Comput 6(3):505\u2013517","journal-title":"SIAM J Comput"},{"unstructured":"Wang J, Zeng Z, Zhou L (2006) Clan: An algorithm for mining closed cliques from large dense graph databases. In: ICDE, pp 73\u201382","key":"33_CR37"},{"doi-asserted-by":"crossref","unstructured":"Wu B, Yang S, zhao H, Wang B (2009) A distributed algorithm to enumerate all maximal cliques in mapreduce. In: International conference on frontier of computer science and technology, pp 45\u201351","key":"33_CR38","DOI":"10.1109\/FCST.2009.30"},{"unstructured":"Xiang JG, Guo C, Aboulnaga A (2013) Scalable maximum clique computation using mapreduce. In: ICDE, pp 74\u201385","key":"33_CR39"},{"doi-asserted-by":"crossref","unstructured":"Yang S, Wang B, zhao H, Wu B (2009) Efficient dense structure mining using mapreduce. In: IEEE international conference on data mining workshops, pp 332\u2013337","key":"33_CR40","DOI":"10.1109\/ICDMW.2009.48"},{"unstructured":"Zhang Y, Abu-Khzam FN, Baldwin NE, Chesler EJ, Langston MA, Samatova NF (2005) Genome-scale computational approaches to memory-intensive applications in systems biology. In: ACM\/IEEE supercomputing, pp 12\u201312","key":"33_CR41"},{"doi-asserted-by":"crossref","unstructured":"Zou ZN, Li JZ, Gao H, Zhang S (2010) Finding top-k maximal cliques in an uncertain graph. In: ICDE, pp 649\u2013652","key":"33_CR42","DOI":"10.1109\/ICDE.2010.5447891"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-017-0033-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-017-0033-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-017-0033-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T06:13:58Z","timestamp":1568787238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-017-0033-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s41019-017-0033-5","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}