{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T16:50:58Z","timestamp":1771606258311,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s11390-019-1905-0","type":"journal-article","created":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T05:27:49Z","timestamp":1548480469000},"page":"170-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Who Should Be Invited to My Party: A Size-Constrained k-Core Problem in Social Networks"],"prefix":"10.1007","volume":"34","author":[{"given":"Yu-Liang","family":"Ma","sequence":"first","affiliation":[]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Fei-Da","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Guo-Ren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Jian-Zong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"key":"1905_CR1","unstructured":"Allen J. Event Planning: The Ultimate Guide to Successful Meetings, Corporate Events, Fundraising Galas, Conferences, Conventions, Incentives and Other Special Events (2nd edition). Wiley, 2008."},{"issue":"9","key":"1905_CR2","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1109\/TKDE.2016.2565468","volume":"28","author":"J She","year":"2016","unstructured":"She J, Tong Y, Chen L, Cao C C. Conflict-aware eventparticipant arrangement and its variant for online setting. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(9): 2281-2295.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1905_CR3","doi-asserted-by":"crossref","unstructured":"She J, Tong Y, Chen L, Song T. Feedback-aware social event-participant arrangement. In Proc. ACM SIGMOD International Conference on Management of Data, May 2017, pp.851-865.","DOI":"10.1145\/3035918.3064020"},{"issue":"6","key":"1905_CR4","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1007\/s11280-015-0377-6","volume":"19","author":"Y Tong","year":"2016","unstructured":"Tong Y, She J, Meng R. Bottleneck-aware arrangement over event-based social networks: The max-min approach. World Wide Web, 2016, 19(6): 1151-1177.","journal-title":"World Wide Web"},{"issue":"6","key":"1905_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"16","author":"O Sinnen","year":"2005","unstructured":"Sinnen O, Sousa L A. Communication contention in task scheduling. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(6): 503-515.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"11","key":"1905_CR6","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.14778\/3137628.3137643","volume":"10","author":"Y Tong","year":"2017","unstructured":"Tong Y, Wang L, Zhou Z, Ding B, Chen L, Ye J, Xu K. Flexible online task assignment in real-time spatial data. Proceedings of the VLDB Endowment 2017, 10(11): 1334-1345.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1905_CR7","doi-asserted-by":"crossref","unstructured":"Tong Y, She J, Ding B, Wang L, Chen L. Online mobile micro-task allocation in spatial crowdsourcing. In Proc. the 32nd International Conference on Data Engineering, May 2016, pp.49-60.","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"1905_CR8","doi-asserted-by":"crossref","unstructured":"She J, Tong Y, Chen L. Utility-aware social eventparticipant planning. In Proc. ACM SIGMOD International Conference on Management of Data, May 2015, pp.1629-1643.","DOI":"10.1145\/2723372.2749446"},{"issue":"8","key":"1905_CR9","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1109\/TKDE.2018.2797962","volume":"30","author":"Y Tong","year":"2018","unstructured":"Tong Y, Chen L, Zhou Z, Jagadish H V, Shou L, Lv W. SLADE: A smart large-scale task decomposer in crowdsourcing. IEEE Transactions on Knowledge and Data Engineering, 2018, 30(8): 1588-1601.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1905_CR10","doi-asserted-by":"crossref","unstructured":"Scott J. Social Network Analysis (3rd edition). Sage, 2012.","DOI":"10.1007\/978-1-4614-1800-9_178"},{"key":"1905_CR11","doi-asserted-by":"crossref","unstructured":"Knoke D, Yang S. Social Network Analysis (2nd edition). Sage Publishers, 2007","DOI":"10.4135\/9781412985864"},{"issue":"1\/2","key":"1905_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey R G, Fellows M R. Fixed parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 1995, 141(1\/2): 109-131.","journal-title":"Theoretical Computer Science"},{"key":"1905_CR13","unstructured":"Tan P N, Steinbach M, Kumar V. Introduction to Data Mining (1st edition). Pearson India, 2006."},{"issue":"5","key":"1905_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2001","unstructured":"Guha S, Rastogi R, Shim K. ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 2001, 25(5): 345-366.","journal-title":"Information Systems"},{"key":"1905_CR15","unstructured":"Spitzer F. Principles of Random Walk (2nd edition). Springer, 2001"},{"issue":"3","key":"1905_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman S B. Network structure and minimum degree. Social Networks, 1983, 5(3): 269-287.","journal-title":"Social Networks"},{"issue":"1","key":"1905_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2850469.2850471","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid W, Barsky M, Srinivasan V, Thomo A. K-core decomposition of large networks on a single PC. Proceedings of the VLDB Endowment, 2015, 9(1): 13-23.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1905_CR18","unstructured":"West D B. Introduction to Graph Theory (2nd edition). Pearson, 2000."},{"key":"1905_CR19","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C. RMAT: A recursive model for graph mining. In Proc. the 4th SIAM International Conference on Data Mining, April 2004, pp.442-446.","DOI":"10.1137\/1.9781611972740.43"},{"issue":"6","key":"1905_CR20","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TKDE.2017.2656079","volume":"29","author":"Y Yuan","year":"2017","unstructured":"Yuan Y, Lian X, Chen L, Yu J X,Wang G, Sun Y. Keyword search over distributed graphs with compressed signature. IEEE Transactions on Knowledge and Data Engineering, 2017, 29(6): 1212-1225.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1905_CR21","unstructured":"Hanneman R A, Riddle M. Introduction to Social Network Methods. University of California, 2005."},{"issue":"2","key":"1905_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce R D, Perry A D. A method of matrix analysis of group structure. Psychometrika, 1949, 14(2): 95-116.","journal-title":"Psychometrika"},{"issue":"9","key":"1905_CR23","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C. Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 1973, 16(9): 575-576.","journal-title":"Communications of the ACM"},{"key":"1905_CR24","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Fu A W C, Yu J X, Zhu L. Finding maximal cliques in massive networks by h*-graph. In Proc. ACM SIGMOD International Conference on Management of Data, June 2010, pp.447-458.","DOI":"10.1145\/1807167.1807217"},{"issue":"2","key":"1905_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce R D. Connectivity and generalized cliques in sociometric group structure. Psychometrika, 1950, 15(2): 169-190.","journal-title":"Psychometrika"},{"issue":"1","key":"1905_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman S B, Foster B L. A graph-theoretic generalization of the clique concept*. Journal of Mathematical Sociology, 1978, 6(1): 139-154.","journal-title":"Journal of Mathematical Sociology"},{"issue":"4","key":"1905_CR27","doi-asserted-by":"publisher","first-page":"040601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"S Dorogovtsev","year":"2006","unstructured":"Dorogovtsev S, Goltsev A V, Mendes J F. K-core organization of complex networks. Physical Review Letters, 2006, 96(4): 040601.","journal-title":"Physical Review Letters"},{"key":"1905_CR28","unstructured":"Alvarez-Hamelin J I, Dall\u2019Asta L, Barrat A, Vespignani A. k-core decomposition: A tool for the visualization of large scale networks. arXiv:0504107, 2005. \n                    https:\/\/arxiv.org\/abs\/cs\/0504107\n                    \n                  , May, 2018."},{"issue":"2","key":"1905_CR29","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s11227-009-0299-0","volume":"53","author":"H Zhang","year":"2010","unstructured":"Zhang H, Zhao H, Cai W, Liu J, Zhou W. Using the k-core decomposition to analyze the static structure of large-scale software systems. The Journal of Supercomputing, 2010, 53(2): 352-369.","journal-title":"The Journal of Supercomputing"},{"issue":"6","key":"1905_CR30","doi-asserted-by":"publisher","first-page":"433","DOI":"10.14778\/2536336.2536344","volume":"6","author":"AE Sar\u00edy\u00fcce","year":"2013","unstructured":"Sar\u00edy\u00fcce A E, Gedik B, Jacques-Silva G, Wu K L, Cataly\u00fcrek \u00dc V. Streaming algorithms for k-core decomposition. Proceedings of the VLDB Endowment, 2013, 6(6): 433-444.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1905_CR31","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, \u00d6zsu M T. Efficient core decomposition in massive networks. In Proc. the 27th International Conference on Data Engineering, April 2011, pp.51-62.","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"1905_CR32","doi-asserted-by":"crossref","unstructured":"Wen D, Qin L, Zhang Y, Lin X. I\/O efficient core graph decomposition at web scale. In Proc. the 32nd International Conference on Data Engineering, May 2016, pp.133-144.","DOI":"10.1109\/ICDE.2016.7498235"},{"issue":"10","key":"1905_CR33","doi-asserted-by":"publisher","first-page":"998","DOI":"10.14778\/3115404.3115406","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang F, Zhang Y, Qin L, Zhang W, Lin X. When engagement meets similarity: Efficient (k, r)-core computation on social networks. Proceedings of the VLDB Endowment, 2017, 10(10): 998-1009.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"1905_CR34","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen J. Graph twiddling in a MapReduce world. Computing in Science & Engineering, 2009, 11(4): 29-41.","journal-title":"Computing in Science & Engineering"},{"issue":"9","key":"1905_CR35","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang J, Cheng J. Truss decomposition in massive networks. Proceedings of the VLDB Endowment, 2012, 5(9): 812-823.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1905_CR36","doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu J X. Querying k-truss community in large and dynamic graphs. In Proc. ACM SIGMOD International Conference on Management of Data, June 2014, pp.1311-1322.","DOI":"10.1145\/2588555.2610495"},{"key":"1905_CR37","doi-asserted-by":"crossref","unstructured":"Chen P L, Chou C K, Chen M S. Distributed algorithms for k-truss decomposition. In Proc. the 2014 IEEE International Conference on Big Data, October 2015, pp.471-480.","DOI":"10.1109\/BigData.2014.7004264"},{"issue":"2","key":"1905_CR38","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TKDE.2010.230","volume":"24","author":"K Deng","year":"2012","unstructured":"Deng K, Sadiq S, Zhou X, Xu H, Fung G P C, Lu Y. On group nearest group query processing. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(2): 295-308.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"10","key":"1905_CR39","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1109\/TKDE.2015.2419663","volume":"27","author":"Y Li","year":"2015","unstructured":"Li Y, Chen R, Xu J, Huang Q, Hu H, Choi B. Geo-social k-cover group queries for collaborative spatial computing. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(10): 2729-2742.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"1905_CR40","doi-asserted-by":"publisher","first-page":"397","DOI":"10.14778\/1978665.1978671","volume":"4","author":"DN Yang","year":"2011","unstructured":"Yang D N, Chen Y L, Lee W C, Chen M S. On socialtemporal group query with acquaintance constraint. Proceedings of the VLDB Endowment, 2011, 4(6): 397-408.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1905_CR41","doi-asserted-by":"crossref","unstructured":"Yang D N, Shen C Y, Lee W C, Chen M S. On sociospatial group query for location-based social networks. In Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 2012, pp.949-957.","DOI":"10.1145\/2339530.2339679"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-019-1905-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-019-1905-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-019-1905-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:11:37Z","timestamp":1579306297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-019-1905-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1905"],"URL":"https:\/\/doi.org\/10.1007\/s11390-019-1905-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"28 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}