{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:02:50Z","timestamp":1786978970765,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319320489","type":"print"},{"value":"9783319320496","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32049-6_16","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T08:47:36Z","timestamp":1458809256000},"page":"249-264","source":"Crossref","is-referenced-by-count":15,"title":["Parallelizing Maximal Clique Enumeration Over Graph Data"],"prefix":"10.1007","author":[{"given":"Qun","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Suo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhanhuai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zachary G.","family":"Ives","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"16_CR1","unstructured":"Mapreduce. \n                      http:\/\/en.wikipedia.org\/wiki\/MapReduce"},{"key":"16_CR2","unstructured":"Real graph datasets. \n                      http:\/\/snap.stanford.edu\/data\/"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10878-010-9338-2","volume":"23","author":"B McClosky","year":"2012","unstructured":"McClosky, B., Hicks, I.V.: Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim. 23, 29\u201349 (2012)","journal-title":"J. Comb. Optim."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"On, B.W., Elmacioglu, E., et al.: Improving grouped-entity resolution using quasi-cliques. In: ICDM (2006)","DOI":"10.1109\/ICDM.2006.85"},{"issue":"9","key":"16_CR5","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":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., et al.: Finding maximal cliques in massive networksby H*-graph. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807217"},{"key":"16_CR7","unstructured":"Bader, D.A., Madduri, K.: GTgraph: a synthetic graph generator suite (2006). \n                      http:\/\/www.cse.psu.edu\/madduri\/software\/GTgraph\/"},{"key":"16_CR8","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)"},{"key":"16_CR9","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, Part I. LNCS, vol. 6506, pp. 403\u2013414. Springer, Heidelberg (2010)"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1\u20136 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","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.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"16_CR12","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1\u20133), 564\u2013568 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"16_CR13","first-page":"1","volume":"4","author":"GA Pavlopoulos","year":"2011","unstructured":"Pavlopoulos, G.A., Secrier, M., et al.: Using graph theory to analyze biological networks. BioData Min. 4(10), 1\u201310 (2011)","journal-title":"BioData Min."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., et al.: Pregel: a system for large-scale graphprocessing. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L.H., et al.: Fast algorithms for maximal clique enumeration with limited memory. In: KDD (2012)","DOI":"10.1145\/2339530.2339724"},{"issue":"4","key":"16_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"James Cheng","year":"2011","unstructured":"Cheng, J., Ke, Y.P., et al.: Finding maximal cliques in massive networks. TODS 36(4), Article No. 21, 1\u201334 (2011)","journal-title":"ACM Transactions on Database Systems"},{"key":"16_CR17","unstructured":"Xiang, J.G., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using mapreduce. In: ICDE (2013)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: SIGKDD (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"16_CR19","unstructured":"Wang, J.Y., Zeng, Z.P., Zhou, L.Z.: CLAN: an algorithm for mining closed cliques from large dense graph databases. In: ICDE (2006)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., et al.: Statistical properties of community structure in large social and information networks. In: WWW, pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Lu, L., Gu, Y., et al.: dMaximalCliques: a distributed algorithm for enumerating all maximal cliques and maximal clique distribution. In: IEEE International Conference on Data Mining Workshops, pp. 1320\u20131327 (2010)","DOI":"10.1109\/ICDMW.2010.13"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., et al.: A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput. 69, 417\u2013428 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11605126_4","volume-title":"Federation over the Web","author":"M Haraguchi","year":"2006","unstructured":"Haraguchi, M., Okubo, Y.: A method for pinpoint clustering of web pages with pseudo-clique search. In: Jantke, K.P., Lunzer, A., Spyratos, N., Tanaka, Y. (eds.) Federation over the Web. LNCS (LNAI), vol. 3847, pp. 59\u201378. Springer, Heidelberg (2006)"},{"issue":"1","key":"16_CR25","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., et al.: A parallel algorithm for enumerating all maximal cliques in complex network. In: ICDM Workshops (2006)","DOI":"10.1109\/ICDMW.2006.17"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Modani, N., Dey, K.: Large maximal cliques enumeration in sparse graphs. In: CIKM, pp. 1377\u20131378 (2008)","DOI":"10.1145\/1458082.1458288"},{"key":"16_CR28","unstructured":"Chen, Q., Fang, C., et al.: Parallelizing clique and quasi-clique detection over graph data. Technical report, Northwestern Polytechnical University, (2014). \n                      http:\/\/wowbigdata.cn\/paper\/clique.pdf"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Gleich, D.F., et al.: Fast maximum clique algorithms for large graphs. In: WWW (2014)","DOI":"10.1145\/2567948.2577283"},{"key":"16_CR30","unstructured":"Hanneman, R.: Introduction to social network methods, Chap. 11:cliques (2005). \n                      http:\/\/faculty.ucr.edu\/~hanneman\/nettext\/"},{"issue":"3","key":"16_CR31","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"16_CR32","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/B:COAP.0000008651.28952.b6","volume":"27","author":"V Stix","year":"2004","unstructured":"Stix, V.: Finding all maximal cliques in dynamic graphs. Comput. Optim. Appl. 27, 173\u2013186 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Wu, B., Yang, S., et al.: A distributed algorithm to enumerate all maximal cliques in mapreduce. In: International Conference on Frontier of Computer Science and Technology, pp. 45\u201351 (2009)","DOI":"10.1109\/FCST.2009.30"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Yang, S., Wang, B., et al.: Efficient dense structure mining using mapreduce. In: IEEE International Conference on Data Mining Workshops, pp. 332\u2013337 (2009)","DOI":"10.1109\/ICDMW.2009.48"},{"key":"16_CR35","unstructured":"Zhang, Y., Abu-Khzam, F.N., et al.: Genome-scale computational approaches to memory-intensive applications in systems biology. In: ACM\/IEEE Supercomputing (2005)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32049-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:57:58Z","timestamp":1559411878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32049-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320489","9783319320496"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32049-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}