{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:02:17Z","timestamp":1771704137877,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,2,16]],"date-time":"2014-02-16T00:00:00Z","timestamp":1392508800000},"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":[[2014,2,16]]},"DOI":"10.1145\/2567634.2567640","type":"proceedings-article","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T13:25:03Z","timestamp":1393939503000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Maximal clique enumeration for large graphs on hadoop framework"],"prefix":"10.1145","author":[{"given":"Naga Shailaja","family":"Dasari","sequence":"first","affiliation":[{"name":"Old Dominion University, Norfolk, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Desh","family":"Ranjan","sequence":"additional","affiliation":[{"name":"Old Dominion University, Norfolk, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zubair","family":"Mohammad","sequence":"additional","affiliation":[{"name":"Old Dominion University, Norfolk, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,2,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_1_2_1","unstructured":"V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks 2003. URL http:\/\/arxiv.org\/abs\/cs\/0310049. cite arxiv:cs\/0310049.  V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks 2003. URL http:\/\/arxiv.org\/abs\/cs\/0310049. cite arxiv:cs\/0310049."},{"key":"e_1_3_2_1_3_1","unstructured":"A. M. Benedikt Elser and. A novel parallel algorithm for maximal clique enumeration on multicore and distributed memory architectures. URL http:\/\/www.so.in.tum.de\/ elser\/elser13bigdata.pdf.  A. M. Benedikt Elser and. A novel parallel algorithm for maximal clique enumeration on multicore and distributed memory architectures. URL http:\/\/www.so.in.tum.de\/ elser\/elser13bigdata.pdf."},{"key":"e_1_3_2_1_4_1","volume-title":"Emergent Clique Formation in Terrorist Recruitmen. National Conference on Artificial Intelligence","author":"Berry N.","year":"2004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1110\/ps.051428205"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168842"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.32"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-011-0183-2"},{"key":"e_1_3_2_1_10_1","unstructured":"N. S. Dasari M. Zubair and D. Ranjan. A novel parallel algorithm for maximal clique enumeration on multicore and distributed memory architectures. URL http:\/\/www.cs.odu.edu\/ ndasari\/pBitMCE.pdf.  N. S. Dasari M. Zubair and D. Ranjan. A novel parallel algorithm for maximal clique enumeration on multicore and distributed memory architectures. URL http:\/\/www.cs.odu.edu\/ ndasari\/pBitMCE.pdf."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348552"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88067-7_12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/364520.364540"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008656"},{"key":"e_1_3_2_1_17_1","unstructured":"D.\n       \n      Eppstein M.\n       \n      L\u00f6ffler and \n      \n      \n      D.\n       \n      Strash\n      \n  \n  . \n  Listing all maximal cliques in sparse graphs in near-optimal time. In phAlgorithms and Computation volume \n  6506\n   of \n  phLecture Notes in Computer Science pages \n  403\n  --\n  414\n  . \n  Springer Berlin Heidelberg 2010\n  . ISBN 978--3--642--17516--9.  D. Eppstein M. L\u00f6ffler and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In phAlgorithms and Computation volume 6506 of phLecture Notes in Computer Science pages 403--414. Springer Berlin Heidelberg 2010. ISBN 978--3--642--17516--9."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"F. Harary and I. C. Ross. A procedure for clique detection using the group matrix. phSociometry 20: 205--215 1957. http:\/\/www.jstor.org\/stable\/2785673.  F. Harary and I. C. Ross. A procedure for clique detection using the group matrix. phSociometry 20: 205--215 1957. http:\/\/www.jstor.org\/stable\/2785673.","DOI":"10.2307\/2785673"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti745"},{"issue":"3","key":"e_1_3_2_1_20_1","first-page":"209","article-title":"Cliques of a graph-variations on the Bron-Kerbosch algorithm","volume":"5","author":"Johnston H. C.","year":"1976","journal-title":"International Journal of Parallel Programming"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00286-3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209042"},{"key":"e_1_3_2_1_24_1","unstructured":"J. Leskovec. Stanford Large Network Dataset Collection. URL http:\/\/snap.stanford.edu\/data\/.  J. Leskovec. Stanford Large Network Dataset Collection. URL http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.13"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"A. Montresor F. D. Pellegrini and D. Miorandi. Distributed k-core decomposition. CoRR abs\/1103.5320 2011.  A. Montresor F. D. Pellegrini and D. Miorandi. Distributed k-core decomposition. CoRR abs\/1103.5320 2011.","DOI":"10.1145\/1993806.1993836"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"J. Moon and L. Moser. On cliques in graphs. phIsrael Journal of Mathematics 3 (1): 23--28 1965. ISSN 0021--2172. 10.1007\/BF02760024. URL http:\/\/dx.doi.org\/10.1007\/BF02760024.  J. Moon and L. Moser. On cliques in graphs. phIsrael Journal of Mathematics 3 (1): 23--28 1965. ISSN 0021--2172. 10.1007\/BF02760024. URL http:\/\/dx.doi.org\/10.1007\/BF02760024.","DOI":"10.1007\/BF02760024"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2001252.2001262"},{"key":"e_1_3_2_1_31_1","volume-title":"10th DIMACS Implementation Challenge - Graph Partitioning and Graph Clustering. (workshop paper)","author":"Riedy J.","year":"2012"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6289126"},{"key":"e_1_3_2_1_33_1","first-page":"1","volume-title":"HPEC","author":"Rutledge E."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.30"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn036"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.29"}],"event":{"name":"PPoPP '14: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Orlando Florida USA","acronym":"PPoPP '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the first workshop on Parallel programming for analytics applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567634.2567640","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2567634.2567640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:39Z","timestamp":1750232079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567634.2567640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,16]]},"references-count":38,"alternative-id":["10.1145\/2567634.2567640","10.1145\/2567634"],"URL":"https:\/\/doi.org\/10.1145\/2567634.2567640","relation":{},"subject":[],"published":{"date-parts":[[2014,2,16]]},"assertion":[{"value":"2014-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}