{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T20:55:03Z","timestamp":1780433703347,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T00:00:00Z","timestamp":1288915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s11634-010-0079-y","type":"journal-article","created":{"date-parts":[[2010,11,4]],"date-time":"2010-11-04T21:25:02Z","timestamp":1288905902000},"page":"129-145","source":"Crossref","is-referenced-by-count":236,"title":["Fast algorithms for determining (generalized) core groups in social networks"],"prefix":"10.1007","volume":"5","author":[{"given":"Vladimir","family":"Batagelj","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matja\u017e","family":"Zaver\u0161nik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,5]]},"reference":[{"key":"79_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed A, Batagelj V, Fu X, Hong S-H, Merrick D, Mrvar A (2007) Visualisation and analysis of the internet movie database. In: Proceedings of the Asia-Pacific symposium on visualisation (APVIS2007), Sydney, NSW, Australia, 5\u20137 February 2007. IEEE, New York, 17\u201324","DOI":"10.1109\/APVIS.2007.329304"},{"issue":"2","key":"79_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3934\/nhm.2008.3.371","volume":"3","author":"JI Alvarez-Hamelin","year":"2008","unstructured":"Alvarez-Hamelin JI, Dall\u2019asta L, Barrat A, Vespignani A (2008) K-core decomposition of internet graphs: hierarchies, selfsimilarity and measurement biases. Netw Heterog Media 3(2): 371\u2013393","journal-title":"Netw Heterog Media"},{"key":"79_CR3","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A (2003) Pajek\u2014analysis and visualization of large networks. In: J\u00fcnger M, Mutzel P (eds) Graph drawing software. Springer, Berlin, pp 77\u2013103. http:\/\/pajek.imfm.si","DOI":"10.1007\/978-3-642-18638-7_4"},{"key":"79_CR4","unstructured":"Batagelj V (2004) Pajek datasets: Geom. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/Data\/Collab\/Geom.htm"},{"key":"79_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0378-8733(00)00023-X","volume":"22","author":"V Batagelj","year":"2000","unstructured":"Batagelj V, Mrvar A (2000) Some analyses of Erd\u0151s collaboration graph. Soc Netw 22: 173\u2013186","journal-title":"Soc Netw"},{"key":"79_CR6","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A, Zaver\u0161nik M (1999) Partitioning approach to visualization of large graphs. In: Kratochv\u00cdl J (ed) Proceedings of 7th international symposium on graph drawing, 15\u201319 September 1999, \u0160ti\u0159\u00edn Castle, Czech Republic (Lecture notes in computer science, vol. 1731). Springer, Berlin, pp 90\u201397","DOI":"10.1007\/3-540-46648-7_9"},{"key":"79_CR7","doi-asserted-by":"crossref","unstructured":"Batagelj V, Brandenburg FJ, Didimo W, Liotta G, Palladino P, Patrignani M (2010) Visual analysis of large graphs using (X;Y)-clustering and hybrid visualizations. In: IEEE Pacific visualization 2010 (PacVis \u201910). IEEE, New YorK, pp 209\u2013216","DOI":"10.1109\/PACIFICVIS.2010.5429591"},{"key":"79_CR8","unstructured":"Beebe NHF (2002) Nelson H. F. Beebe\u2019s bibliographies page. http:\/\/www.math.utah.edu\/~beebe\/bibliographies.html"},{"key":"79_CR9","doi-asserted-by":"crossref","unstructured":"Beiro MG, Alvarez-Hamelin JI, Busch JR (2008) A low complexity visualization tool that helps to perform complex systems analysis. New J Phys 10:125003, 1\u201318","DOI":"10.1088\/1367-2630\/10\/12\/125003"},{"key":"79_CR10","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge"},{"issue":"1\u20132","key":"79_CR11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.physd.2006.09.027","volume":"224","author":"SN Dorogovtsev","year":"2006","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JFF (2006) k-Core architecture and k-core percolation on complex networks. Phys D Nonlinear Phenom 224(1\u20132): 7\u201319","journal-title":"Phys D Nonlinear Phenom"},{"key":"79_CR12","unstructured":"Eisterlehner F, Hotho A, J\u00e4schke R (eds) (2009) Proceedings of ECML PKDD discovery challenge 2009 (DC09). http:\/\/www.kde.cs.uni-kassel.de\/ws\/dc09\/papers\/proceedings.pdf"},{"key":"79_CR13","volume-title":"Computer and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computer and intractability. Freeman, San Francisco"},{"issue":"3","key":"79_CR14","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1214\/07-AAP478","volume":"18","author":"S Janson","year":"2008","unstructured":"Janson S, Luczak MJ (2008) Asymptotic normality of the k-core in random graphs. Ann Appl Probab 18(3): 1085\u20131137","journal-title":"Ann Appl Probab"},{"key":"79_CR15","doi-asserted-by":"crossref","unstructured":"J\u00e4schke R, Marinho L, Hotho A, Schmidt-Thieme L, Stumme G (2007) Tag recommendations in folksonomies. Lecture notes in computer science, vol 4702. Springer, Berlin, pp 506\u2013514","DOI":"10.1007\/978-3-540-74976-9_52"},{"key":"79_CR16","unstructured":"Jones B (2002) Computational geometry database. http:\/\/compgeom.cs.uiuc.edu\/~jeffe\/compgeom\/biblios.html , ftp:\/\/ftp.cs.usask.ca\/pub\/geometry\/"},{"key":"79_CR17","unstructured":"LaNet-vi (2009) Large network visualization tool. http:\/\/xavier.informatics.indiana.edu\/lanet-vi\/"},{"key":"79_CR18","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: 269\u2013287","journal-title":"Soc Netw"},{"key":"79_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/1472-6769-9-4","volume":"9","author":"J-M Schwartz","year":"2009","unstructured":"Schwartz J-M, Nacher JC (2009) Local and global modes of drug action in biochemical networks. BMC Chem Biol 9: 4\u2013114","journal-title":"BMC Chem Biol"},{"issue":"3","key":"79_CR20","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1016\/j.eswa.2007.01.045","volume":"34","author":"J-C Wang","year":"2008","unstructured":"Wang J-C, Chiu C-C (2008) Recommending trusted online auction sellers using social network analysis. Expert Syst Appl Int J Arch 34(3): 1666\u20131679","journal-title":"Expert Syst Appl Int J Arch"},{"key":"79_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"issue":"1","key":"79_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh DJA, Powell MB (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10(1): 85\u201386","journal-title":"Comput J"},{"key":"79_CR23","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/pmic.200400962","volume":"5","author":"S Wuchty","year":"2005","unstructured":"Wuchty S, Almaas E (2005) Peeling the yeast protein network. Proteomics 5: 444\u2013449","journal-title":"Proteomics"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-010-0079-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-010-0079-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-010-0079-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T02:41:53Z","timestamp":1559788913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-010-0079-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,5]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s11634-010-0079-y","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,5]]}}}