{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:08:39Z","timestamp":1763968119872,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icde.2013.6544815","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T15:02:52Z","timestamp":1372258972000},"page":"74-85","source":"Crossref","is-referenced-by-count":39,"title":["Scalable maximum clique computation using MapReduce"],"prefix":"10.1109","author":[{"family":"Jingen Xiang","sequence":"first","affiliation":[]},{"family":"Cong Guo","sequence":"additional","affiliation":[]},{"given":"A.","family":"Aboulnaga","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"17","article-title":"A multilevel algorithm for partitioning graphs","author":"hendrickson","year":"0","journal-title":"Proc Conf on Supercomputing (SC) 1995"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(96)00024-5"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.30"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"13"},{"journal-title":"Giraph Project","year":"0","key":"14"},{"key":"11","article-title":"On inferring autonomous system relationships in the internet","volume":"9","author":"gao","year":"2001","journal-title":"IEEE\/ACM Trans Netw"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S1093-3263(97)00089-2"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289146"},{"key":"20","article-title":"A maximum clique algorithm based on MapReduce","author":"lin","year":"0","journal-title":"Proc Int Conf on Advanced Computer Theory and Engineering 2010"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1978","author":"macwilliams","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582723"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-3279-4_18","article-title":"An exact parallel algorithm for the maximum clique problem","volume":"38","author":"pardalos","year":"1998","journal-title":"High Performance Algorithms and Software in Nonlinear Optimization"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098364"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_67"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_33"},{"journal-title":"Introduction to the Theory of Computation","year":"2012","author":"sipser","key":"29"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.3.CO;2-K"},{"journal-title":"Amazon Elastic Compute Cloud (Amazon EC2)","year":"0","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.38"},{"journal-title":"DIMACS Benchmark Set","year":"0","key":"7"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008136"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1063\/1.3086833"},{"key":"31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11440-3_18","article-title":"A simple and faster branch-and-bound algorithm for finding a maximum clique","author":"tomita","year":"2010","journal-title":"WALCOM Algorithms and Computation"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198259"},{"journal-title":"DIMACS Implementation Challenges","year":"0","key":"8"}],"event":{"name":"2013 29th IEEE International Conference on Data Engineering (ICDE 2013)","start":{"date-parts":[[2013,4,8]]},"location":"Brisbane, QLD","end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 IEEE 29th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530811\/6544790\/06544815.pdf?arnumber=6544815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T11:18:48Z","timestamp":1498043928000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icde.2013.6544815","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}