{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:02Z","timestamp":1725664262180},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/bigdata.2014.7004370","type":"proceedings-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T20:04:23Z","timestamp":1421179463000},"page":"41-45","source":"Crossref","is-referenced-by-count":2,"title":["Toward an efficient, highly scalable maximum clique solver for massive graphs"],"prefix":"10.1109","author":[{"given":"Ronald D.","family":"Hagan","sequence":"first","affiliation":[]},{"given":"Charles A.","family":"Phillips","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Gary L.","family":"Rogers","sequence":"additional","affiliation":[]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7536","article-title":"An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem","author":"li","year":"2010","journal-title":"AAAI'10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"12","first-page":"15","article-title":"Improved exact solver for the weighted max-sat problem","author":"kugel","year":"2012","journal-title":"POS-10 Volume 8 of EPiC Series"},{"key":"3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/ICDE.2013.6544815","article-title":"Scalable maximum clique computation using mapreduce","author":"xiang","year":"2013","journal-title":"Proceedings of 29th IEEE International Conference on Data Engineering (ICDE)"},{"journal-title":"The Maximum Clique Problem Algorithms Applications and Implementations","year":"2010","author":"eblen","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2009.5069351"},{"journal-title":"Network Analysis Platform","year":"0","key":"10"},{"key":"7","first-page":"62","article-title":"Kernelization algorithms for the vertex cover problem: Theory and experiments","author":"abu-khzam","year":"2004","journal-title":"Proceedings Workshop on Algorithm Engineering and Experiments"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.138"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"4","first-page":"365","article-title":"Fast maximum clique algorithms for large graphs","author":"rossi","year":"2014","journal-title":"Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion (WWW Companion)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.2316\/P.2013.795-049"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1214-1"}],"event":{"name":"2014 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2014,10,27]]},"location":"Washington, DC","end":{"date-parts":[[2014,10,30]]}},"container-title":["2014 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6973861\/7004197\/07004370.pdf?arnumber=7004370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T22:01:14Z","timestamp":1690840874000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7004370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2014.7004370","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}