{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:17Z","timestamp":1773481877203,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,6,7]],"date-time":"2015-06-07T00:00:00Z","timestamp":1433635200000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10618-015-0422-1","type":"journal-article","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T04:38:25Z","timestamp":1433565505000},"page":"1406-1433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":124,"title":["Efficient and effective community search"],"prefix":"10.1007","volume":"29","author":[{"given":"Nicola","family":"Barbieri","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Galimberti","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"issue":"2","key":"422_CR1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Zaver\u0161nik M (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5(2):129\u2013145","journal-title":"Adv Data Anal Classif"},{"key":"422_CR2","doi-asserted-by":"crossref","unstructured":"Bogdanov P, Baumer B, Basu P, Bar-Noy A, Singh AK (2013) As strong as the weakest link: mining diverse cliques in weighted graphs. In: European Conference on Machine Learning and Knowledge Discovery (ECML\/PKDD), pp 525\u2013540","DOI":"10.1007\/978-3-642-40988-2_34"},{"key":"422_CR3","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"key":"422_CR4","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: ACM SIGMOD International Conference on Management of Data, pp 277\u2013288","DOI":"10.1145\/2463676.2463722"},{"key":"422_CR5","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: ACM SIGMOD International Conference on Management of Data, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"key":"422_CR6","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res (JMLR) 7:1\u201330","journal-title":"J Mach Learn Res (JMLR)"},{"issue":"3\u20135","key":"422_CR7","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\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"422_CR8","doi-asserted-by":"crossref","unstructured":"Gabow HN, Tarjan RE (1983) A linear-time algorithm for a special case of disjoint set union. In: ACM Symposium on Theory of Computing (STOC), pp 246\u2013251","DOI":"10.1145\/800061.808753"},{"key":"422_CR9","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. Technical report, University of California at Berkeley"},{"key":"422_CR10","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: ACM SIGMOD International Conference on Management of Data, pp 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"issue":"3","key":"422_CR11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/1297332.1297336","volume":"1","author":"Y Koren","year":"2007","unstructured":"Koren Y, North SC, Volinsky C (2007) Measuring and extracting proximity graphs in networks. ACM Trans Knowl Discov Data (TKDD) 1(3):12","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"2","key":"422_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Inform 15(2):141\u2013145","journal-title":"Acta Inform"},{"key":"422_CR13","doi-asserted-by":"crossref","unstructured":"Lee VE, Ruan N, Jin R, Aggarwal CC (2010) A survey of algorithms for dense subgraph discovery. In: Managing and Mining Graph Data, pp 303\u2013336","DOI":"10.1007\/978-1-4419-6045-0_10"},{"issue":"5","key":"422_CR14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li R-H, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. Proc VLDB Endow (PVLDB) 8(5):509\u2013520","journal-title":"Proc VLDB Endow (PVLDB)"},{"issue":"3","key":"422_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K Mehlhorn","year":"1988","unstructured":"Mehlhorn K (1988) A faster approximation algorithm for the Steiner problem in graphs. Inf Process Lett 27(3):125\u2013128","journal-title":"Inf Process Lett"},{"issue":"3","key":"422_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"key":"422_CR17","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 939\u2013948","DOI":"10.1145\/1835804.1835923"},{"key":"422_CR18","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C (2006) Center-piece subgraphs: problem definition and fast solutions. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 404\u2013413","DOI":"10.1145\/1150402.1150448"},{"issue":"5","key":"422_CR19","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 (2015) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endow (PVLDB) 8(5):798\u2013809","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"422_CR20","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK (2013) Labelrank: a stabilized label propagation algorithm for community detection in networks. In: IEEE Network Science Workshop","DOI":"10.1109\/NSW.2013.6609210"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0422-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0422-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0422-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:46Z","timestamp":1559244586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0422-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,7]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["422"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0422-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,7]]}}}