{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T13:46:11Z","timestamp":1768311971305,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Huawei Technologies (CN)","award":["HWLB06-15C03212\/13PN"],"award-info":[{"award-number":["HWLB06-15C03212\/13PN"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s41019-017-0051-3","type":"journal-article","created":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T03:30:07Z","timestamp":1510543807000},"page":"257-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Query Optimal k-Plex Based Community in Graphs"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8618-9806","authenticated-orcid":false,"given":"Yue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xun","family":"Jian","sequence":"additional","affiliation":[]},{"given":"Zhenhua","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jia","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,13]]},"reference":[{"issue":"3","key":"51_CR1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","volume":"66","author":"G Agarwal","year":"2008","unstructured":"Agarwal G, Kempe D (2008) Modularity-maximizing graph communities via mathematical programming. Eur Phys J B 66(3):409\u2013418","journal-title":"Eur Phys J B"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Andersen R, Chellapilla K (2009) Finding dense subgraphs with size bounds. In: Proceedings of algorithms and models for the web-graph, 6th international workshop, WAW 2009, Barcelona, Spain, February 12\u201313, 2009, pp 25\u201337","DOI":"10.1007\/978-3-540-95995-3_3"},{"issue":"1","key":"51_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram B, Butenko S, Hicks IV (2011) Clique relaxations in social network analysis: the maximum k-plex problem. Oper Res 59(1):133\u2013142","journal-title":"Oper Res"},{"issue":"5","key":"51_CR4","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri N, Bonchi F, Galimberti E, Gullo F (2015) Efficient and effective community search. Data Min Knowl Discov 29(5):1406\u20131433","journal-title":"Data Min Knowl Discov"},{"key":"51_CR5","unstructured":"Batagelj V, Zaversnik M (2003) An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Berlowitz D, Cohen S, Kimelfeld B (2015) Efficient enumeration of maximal k-plexes. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, Melbourne, Victoria, Australia, May 31\u2013June 4, 2015, pp 431\u2013444","DOI":"10.1145\/2723372.2746478"},{"issue":"2","key":"51_CR7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172\u2013188","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"51_CR8","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: Proceedings of approximation algorithms for combinatorial optimization, third international workshop, APPROX 2000, Saarbr\u00fccken, Germany, September 5\u20138, 2000, pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, ACM, pp 277\u2013288","DOI":"10.1145\/2463676.2463722"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: International conference on management of data, SIGMOD 2014, Snowbird, UT, USA, June 22\u201327, 2014, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"issue":"3","key":"51_CR12","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige U, Kortsarz G, Peleg D (2001) The dense k-subgraph problem. Algorithmica 29(3):410\u2013421","journal-title":"Algorithmica"},{"issue":"3","key":"51_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"issue":"1","key":"51_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barth\u00e9lemy M (2007) Resolution limit in community detection. Proc Nat Acad Sci 104(1):36\u201341","journal-title":"Proc Nat Acad Sci"},{"key":"51_CR15","volume-title":"Finding a maximum density subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. University of California, Berkeley, Berkeley"},{"issue":"1","key":"51_CR16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within \n                        $$n^{1-\\epsilon }$$\n                        \n                            \n                                            \n                                \n                                    n\n                                    \n                                        1\n                                        -\n                                        \u03f5\n                                    \n                                \n                            \n                        \n                    . Acta Math 182(1):105\u2013142","journal-title":"Acta Math"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: International conference on management of data, SIGMOD 2014, Snowbird, UT, USA, June 22\u201327, 2014, pp 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"51_CR18","first-page":"276","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan LVS, Yu JX, Cheng H (2015) Approximate closest community search in networks. PVLDB 9(4):276\u2013287","journal-title":"PVLDB"},{"key":"51_CR19","volume-title":"Analyzing the structure of large graphs","author":"R Kannan","year":"1999","unstructured":"Kannan R, Vinay V (1999) Analyzing the structure of large graphs. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn, Bonn"},{"key":"51_CR20","doi-asserted-by":"crossref","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs. In: Proceedings of automata, languages and programming, 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5\u201312, 2009, Part I, pp 597\u2013608","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Li K, Lu W, Bhagat S, Lakshmanan LVS, Yu C (2014) On social event organization. In: The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201914, New York, NY, USA, August 24\u201327, 2014, pp 1206\u20131215","DOI":"10.1145\/2623330.2623724"},{"issue":"5","key":"51_CR22","first-page":"509","volume":"8","author":"R Li","year":"2015","unstructured":"Li R, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. PVLDB 8(5):509\u2013520","journal-title":"PVLDB"},{"key":"51_CR23","unstructured":"McDermott R (2000) Knowing in community. IHRIM 19"},{"issue":"6","key":"51_CR24","doi-asserted-by":"crossref","first-page":"066,133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133","journal-title":"Phys Rev E"},{"issue":"5","key":"51_CR25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00389540","volume":"5","author":"L Rowe","year":"1994","unstructured":"Rowe L, Nadeau J, Turner R, Frankel W, Letts V, Eppig J, Ko M, Thurston S, Birkenmeier E (1994) Maps from two interspecific backcross dna panels available as a community genetic mapping resource. Mamm Genome 5(5):253\u2013274","journal-title":"Mamm Genome"},{"issue":"1","key":"51_CR26","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph-theoretic generalization of the clique concept. J Math Sociol 6(1):139\u2013154","journal-title":"J Math Sociol"},{"issue":"2","key":"51_CR27","doi-asserted-by":"crossref","first-page":"026,108","DOI":"10.1103\/PhysRevE.84.026108","volume":"84","author":"DM Song","year":"2011","unstructured":"Song DM, Tumminello M, Zhou WX, Mantegna RN (2011) Evolution of worldwide stock markets, correlation structure, and correlation-based graphs. Phys Rev E 84(2):026,108","journal-title":"Phys Rev E"},{"key":"51_CR28","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 939\u2013948","DOI":"10.1145\/1835804.1835923"},{"key":"51_CR29","doi-asserted-by":"crossref","unstructured":"Tsourakakis C (2015) The k-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, pp 1122\u20131132","DOI":"10.1145\/2736277.2741098"},{"issue":"7","key":"51_CR30","doi-asserted-by":"crossref","first-page":"798","DOI":"10.14778\/2752939.2752948","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu Y, Jin R, Li J, Zhang X (2015a) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endow 8(7):798\u2013809","journal-title":"Proc VLDB Endow"},{"issue":"7","key":"51_CR31","first-page":"798","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu Y, Jin R, Li J, Zhang X (2015b) Robust local community detection: on free rider effect and its elimination. PVLDB 8(7):798\u2013809","journal-title":"PVLDB"},{"issue":"4","key":"51_CR32","first-page":"43","volume":"45","author":"J Xie","year":"2013","unstructured":"Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv (csur) 45(4):43","journal-title":"ACM Comput Surv (csur)"}],"updated-by":[{"DOI":"10.1007\/s41019-017-0059-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000}}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-017-0051-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-017-0051-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-017-0051-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T09:31:57Z","timestamp":1513243917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-017-0051-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,13]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s41019-017-0051-3","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s41019-017-0059-8","asserted-by":"object"}]},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,13]]}}}