{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:44:54Z","timestamp":1649133894899},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T00:00:00Z","timestamp":1402444800000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s11432-013-4930-6","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T23:34:19Z","timestamp":1402443259000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Global core, and galaxy structure of networks"],"prefix":"10.1007","volume":"57","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"YiCheng","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Pan","family":"Peng","sequence":"additional","affiliation":[]},{"given":"JianKou","family":"Li","sequence":"additional","affiliation":[]},{"given":"XueChen","family":"Li","sequence":"additional","affiliation":[]},{"given":"AngSheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"4930_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S Seidman","year":"1983","unstructured":"Seidman S. Network structure and minimum degree. Soc Netw, 1983, 5: 269\u2013287","journal-title":"Soc Netw"},{"key":"4930_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"S Borgatti","year":"2000","unstructured":"Borgatti S, Everett M. Models of core\/periphery structures. Soc Netw, 2000, 21: 375\u2013395","journal-title":"Soc Netw"},{"key":"4930_CR3","first-page":"41","volume":"18","author":"J Alvarez-Hamelin","year":"2006","unstructured":"Alvarez-Hamelin J, Dall Asta L, Barrat A, et al. Large scale networks fingerprinting and visualization using the k-core decomposition. Adv Neural Inf Process Syst, 2006, 18: 41","journal-title":"Adv Neural Inf Process Syst"},{"key":"4930_CR4","doi-asserted-by":"crossref","first-page":"056101","DOI":"10.1103\/PhysRevE.73.056101","volume":"73","author":"A Goltsev","year":"2006","unstructured":"Goltsev A, Dorogovtsev S, Mendes J. k-core (bootstrap) percolation on complex networks: critical phenomena and nonlocal effects. Phys Rev E, 2006, 73: 056101","journal-title":"Phys Rev E"},{"key":"4930_CR5","doi-asserted-by":"crossref","first-page":"046111","DOI":"10.1103\/PhysRevE.72.046111","volume":"72","author":"P Holme","year":"2005","unstructured":"Holme P. Core-periphery organization of complex networks. Phys Rev E, 2005, 72: 046111","journal-title":"Phys Rev E"},{"key":"4930_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.jet.2007.07.007","volume":"139","author":"D Hojman","year":"2008","unstructured":"Hojman D, Szeidl A. Core and periphery in networks. J Econ Theory, 2008, 139: 295\u2013309","journal-title":"J Econ Theory"},{"key":"4930_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1298306.1298311","volume-title":"Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement","author":"A Mislove","year":"2007","unstructured":"Mislove A, Marcon M, Gummadi K, et al. Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. New York: ACM, 2007. 29\u201342"},{"key":"4930_CR8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D Hochbaum","year":"1987","unstructured":"Hochbaum D, Shmoys D. Using dual approximation algorithms for scheduling problems theoretical and practical results. J ACM, 1987, 34: 144\u2013162","journal-title":"J ACM"},{"key":"4930_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W Hsu","year":"1979","unstructured":"Hsu W, Nemhauser G. Easy and hard bottleneck location problems. Discrete Appl Math, 1979, 1: 209\u2013215","journal-title":"Discrete Appl Math"},{"key":"4930_CR10","first-page":"475","volume-title":"47th Annual IEEE Symposium on Foundations of Computer Science","author":"R Andersen","year":"2006","unstructured":"Andersen R, Chung F, Lang K. Local graph partitioning using pagerank vectors. In: 47th Annual IEEE Symposium on Foundations of Computer Science. Washington D. C.: IEEE, 2006. 475\u2013486"},{"key":"4930_CR11","first-page":"235","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"R Andersen","year":"2009","unstructured":"Andersen R, Peres Y. Finding sparse cuts locally using evolving sets. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM, 2009. 235\u2013244"},{"key":"4930_CR12","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman M, Moore C. Finding community structure in very large networks. Phys Rev E, 2004, 70: 066111","journal-title":"Phys Rev E"},{"key":"4930_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. Community detection in graphs. Phys Rep, 2010, 486: 75\u2013174","journal-title":"Phys Rep"},{"key":"4930_CR14","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman M. Community structure in social and biological networks. Proc Nat Acad Sci, 2002, 99: 7821","journal-title":"Proc Nat Acad Sci"},{"key":"4930_CR15","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A. On clusterings: good, bad and spectral. J ACM, 2004, 51: 497\u2013515","journal-title":"J ACM"},{"key":"4930_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang K, Dasgupta A, et al. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math, 2009, 6: 29\u2013123","journal-title":"Internet Math"},{"key":"4930_CR17","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/1772690.1772755","volume-title":"Proceedings of the 19th International Conference on World Wide Web, Raleigh","author":"J Leskovec","year":"2010","unstructured":"Leskovec J, Lang K, Mahoney M. Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th International Conference on World Wide Web, Raleigh, 2010. 631\u2013640"},{"key":"4930_CR18","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1145\/956750.956816","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J Hopcroft","year":"2003","unstructured":"Hopcroft J, Khan O, Kulis B, et al. Natural communities in large linked networks. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2003. 541\u2013546"},{"key":"4930_CR19","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg von","year":"2007","unstructured":"von Luxburg U. A tutorial on spectral clustering. Stat Comput, 2007, 17: 395\u2013416","journal-title":"Stat Comput"},{"key":"4930_CR20","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman M, Girvan M. Finding and evaluating community structure in networks. Phys Rev E, 2004, 69: 026113","journal-title":"Phys Rev E"},{"key":"4930_CR21","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, Diaz-Guilera A, Duch J, et al. Comparing community structure identification. J Stat Mech-Theory Exp, 2005, 2005: P09008","journal-title":"J Stat Mech-Theory Exp"},{"key":"4930_CR22","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, et al. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 2005, 435: 814\u2013818","journal-title":"Nature"},{"key":"4930_CR23","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F. Benchmark graphs for testing community detection algorithms. Phys Rev E, 2008, 78: 046110","journal-title":"Phys Rev E"},{"key":"4930_CR24","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E, 2009, 80: 016118","journal-title":"Phys Rev E"},{"key":"4930_CR25","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1017\/S0960129511000570","volume":"22","author":"A S Li","year":"2012","unstructured":"Li A S, Peng P. The small-community phenomenon in networks. Math Struct Comput Sci, 2012, 22: 373\u2013407","journal-title":"Math Struct Comput Sci"},{"key":"4930_CR26","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2","volume":"18","author":"A Condon","year":"2001","unstructured":"Condon A, Karp R. Algorithms for graph partitioning on the planted partition model. Random Struct Algorithms, 2001, 18: 116\u2013140","journal-title":"Random Struct Algorithms"},{"key":"4930_CR27","first-page":"57","volume-title":"Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"P Domingos","year":"2001","unstructured":"Domingos P, Richardson M. Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2001. 57\u201366"},{"key":"4930_CR28","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"D Kempe","year":"2003","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9. Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2003. 137\u2013146"},{"key":"4930_CR29","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman L. A set of measures of centrality based on betweenness. Sociometry, 40, 1977: 35\u201341","journal-title":"Sociometry"},{"key":"4930_CR30","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si A. Error and attack tolerance of complex networks. Nature, 2000, 406: 378\u2013382","journal-title":"Nature"},{"key":"4930_CR31","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A E A Broder","year":"2000","unstructured":"Broder A E A. Graph structure in the web. Comput Netw, 2000, 33: 309\u2013320","journal-title":"Comput Netw"},{"key":"4930_CR32","doi-asserted-by":"crossref","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen R, Erez K, ben Avraham D, et al. Resilience of the internet to random breakdowns. Phys Rev Lett, 2000, 85: 4626\u20134628","journal-title":"Phys Rev Lett"},{"key":"4930_CR33","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen R, Erez K, ben Avraham D, et al. Network robustness and fragility: percolation on random graphs. Phys Rev Lett, 2000, 85: 5468\u20135471","journal-title":"Phys Rev Lett"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-4930-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-013-4930-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-4930-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:53Z","timestamp":1559403473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-013-4930-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["4930"],"URL":"https:\/\/doi.org\/10.1007\/s11432-013-4930-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,11]]}}}