{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:29Z","timestamp":1779174869567,"version":"3.51.4"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icde.2015.7113300","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:23:28Z","timestamp":1433345008000},"page":"387-398","source":"Crossref","is-referenced-by-count":31,"title":["Diversified top-k clique search"],"prefix":"10.1109","author":[{"given":"Long","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487689"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2009.01.003","article-title":"A scalable, parallel algorithm for maximal clique enumeration","volume":"69","author":"schmidt","year":"2009","journal-title":"J Parallel Distrib Comput"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jplph.2010.09.010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.84"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9632-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835506"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2602136"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860709"},{"key":"ref18","article-title":"Listing all maximal cliques in sparse graphs in near-optimal time","author":"eppstein","year":"2010","journal-title":"ISAAC"},{"key":"ref19","article-title":"Listing all maximal cliques in large sparse real-world graphs","author":"eppstein","year":"2011","journal-title":"Proc of SEA’ 11"},{"key":"ref28","article-title":"Finding a maximum independent set in time","author":"robson","year":"2001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.04.005"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350233"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989405"},{"key":"ref6","article-title":"An o(m) algorithm for cores decomposition of networks","author":"batagelj","year":"2003","journal-title":"CoRR cs DS\/0310049"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref8","article-title":"Emergent Clique Formation in Terrorist Recruitmen","author":"berry","year":"2004","journal-title":"Workshop on Agent Organi-zations Theory and Practice"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(79)90014-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213580"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536263"},{"key":"ref22","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref24","article-title":"Detecting highly overlapping community structure by greedy clique expansion","author":"lee","year":"2010","journal-title":"Proc of the Workshop on Social Network Mining and Analysis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009996"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367854"}],"event":{"name":"2015 IEEE 31st International Conference on Data Engineering (ICDE)","location":"Seoul, South Korea","start":{"date-parts":[[2015,4,13]]},"end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 31st International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7109453\/7113253\/07113300.pdf?arnumber=7113300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T08:54:47Z","timestamp":1498208087000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7113300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/icde.2015.7113300","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}