{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:33:51Z","timestamp":1648776831721},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tkde.2019.2936027","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T19:43:41Z","timestamp":1566503021000},"page":"1-1","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Distributed k-clique Mining for Large Networks Using MapReduce"],"prefix":"10.1109","author":[{"given":"Saeed","family":"Shahrivari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Jalili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Internet: Diameter of the world-wide web","volume":"401","author":"albert","year":"1999","journal-title":"Nature"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"ref31","first-page":"3:1","article-title":"Defining and evaluating network communities based on ground-truth","author":"yang","year":"2012","journal-title":"Proc ACM SIGKDD Workshop Mining Data Semantics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.10.014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref13","article-title":"Finding a maximum independent set in time O ($2^{n\/4}$2n\/4)","author":"robson","year":"2001"},{"key":"ref14","first-page":"415","article-title":"On the complexity of the subgraph problem","volume":"26","author":"ne\u0161et?il","year":"1985","journal-title":"Commentations Mathematicae Universitatis Carolinae"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19487-8_16"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","author":"palla","year":"2005","journal-title":"Nature"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"ref4","author":"baeza-yates","year":"1999","journal-title":"Modern Information Retrieval"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl039"},{"key":"ref29","first-page":"1","article-title":"Data analysis in public social networks","author":"takac","year":"2012","journal-title":"Proc Int Sci Conf Int Workshop Present Day Trends Innovations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1244408.1244417"},{"key":"ref8","author":"vlach","year":"1983","journal-title":"Computer Methods for Circuit Analysis and Design"},{"key":"ref7","author":"schank","year":"2004","journal-title":"Approximating clustering-coefficient and transitivity"},{"key":"ref2","author":"white","year":"2012","journal-title":"Hadoop The Definitive Guide"},{"key":"ref9","author":"russell","year":"1995","journal-title":"Artificial Intelligence A Modern Approach"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1629175.1629198"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577283"},{"key":"ref22","first-page":"74","article-title":"Scalable maximum clique computation using MapReduce","author":"xiang","year":"2013","journal-title":"Proc IEEE 29th Int Conf Data Eng"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.30"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-015-0446-9"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.011"},{"key":"ref26","article-title":"Complexity measures for map-reduce, and comparison to parallel computing","volume":"abs 1211 6526","author":"goel","year":"2012","journal-title":"CoRR"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345408"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08807210.pdf?arnumber=8807210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T16:54:49Z","timestamp":1643216089000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8807210\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2936027","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}