{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:38:48Z","timestamp":1743129528351,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":56,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493971305"},{"type":"electronic","value":"9781493971312"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4939-7131-2_110176","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:23:22Z","timestamp":1528745002000},"page":"419-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Core Decomposition of Massive, Information-Rich Graphs"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Kaltenbrunner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"issue":"10","key":"110176_CR3789","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1109\/TKDE.2013.2297918","volume":"26","author":"H Aksu","year":"2014","unstructured":"Aksu H, Canim M, Chang YC, Korpeoglu I, Ulusoy \u00d6 (2014) Distributed k-core view materialization and maintenance for large dynamic graphs. IEEE Trans Knowledge Data Eng (TKDE) 26(10):2439\u20132452","journal-title":"IEEE Trans Knowledge Data Eng (TKDE)"},{"key":"110176_CR3790","first-page":"498","volume":"14","author":"M Altaf-Ul-Amin","year":"2003","unstructured":"Altaf-Ul-Amin M, Nishikata K, Koma T, Miyasato T, Shinbo Y, Md WC, Maeda M, Oshima T, Mori H, Kanaya S (2003) Prediction of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences. Genome Inform 14:498\u2013499","journal-title":"Genome Inform"},{"key":"110176_CR3791","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2005) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Proceedings of the international conference on neural information processing systems (NIPS), pp 41\u201350"},{"issue":"2","key":"110176_CR3792","doi-asserted-by":"publisher","first-page":"395","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, self-similarity and measurement biases. Networks Heterogeneous Media 3(2):395\u2013411","journal-title":"Networks Heterogeneous Media"},{"key":"110176_CR3793","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","volume-title":"Algorithms and Models for the Web-Graph","author":"Reid Andersen","year":"2009","unstructured":"Andersen R, Chellapilla K (2009) Finding dense subgraphs with size bounds. In: Proceedings of the international work on algorithms and models for the web-graph (WAW), pp 25\u201337"},{"issue":"2","key":"110176_CR3794","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/1944-2866.POI327","volume":"5","author":"P Arag\u00f3n","year":"2013","unstructured":"Arag\u00f3n P, Kappler KE, Kaltenbrunner A, Laniado D, Volkovich Y (2013) Communication dynamics in Twitter during political campaigns: the case of the 2011 Spanish national election. Policy & Internet 5(2):183\u2013206","journal-title":"Policy & Internet"},{"issue":"3","key":"110176_CR3795","doi-asserted-by":"publisher","first-page":"032816","DOI":"10.1103\/PhysRevE.90.032816","volume":"90","author":"N Azimi-Tafreshi","year":"2014","unstructured":"Azimi-Tafreshi N, G\u00f3mez-Garde\u00f1es J, Dorogovtsev SN (2014) k-Core percolation on multiplex networks. Phys Rev E 90(3):032816","journal-title":"Phys Rev E"},{"key":"110176_CR3796","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader GD, Hogue CWV (2003) An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4:2","journal-title":"BMC Bioinformatics"},{"key":"110176_CR3797","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Phys A: Stat Mech Appl 395:549\u2013559","journal-title":"Phys A: Stat Mech Appl"},{"issue":"5","key":"110176_CR3798","doi-asserted-by":"publisher","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 Mining Knowledge Discov 29(5):1406\u20131433","journal-title":"Data Mining Knowledge Discov"},{"issue":"2","key":"110176_CR3799","doi-asserted-by":"publisher","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. ADAC 5(2):129\u2013145","journal-title":"ADAC"},{"key":"110176_CR3800","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A, Zaversnik M (1999) Partitioning approach to visualization of large graphs. In: Proceedings of the international symposium on graph drawing, pp 90\u201397","DOI":"10.1007\/3-540-46648-7_9"},{"key":"110176_CR3801","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S (2004) The webgraph framework I: compression techniques. In: Proceedings of the international conference on World Wide Web (WWW), pp 595\u2013602","DOI":"10.1145\/988672.988752"},{"key":"110176_CR3802","doi-asserted-by":"publisher","first-page":"257","DOI":"10.2307\/1999405","volume":"286","author":"B Bollob\u00e1s","year":"1984","unstructured":"Bollob\u00e1s B (1984) The evolution of random graphs. Trans Am Math Soc 286:257\u2013274","journal-title":"Trans Am Math Soc"},{"key":"110176_CR3803","unstructured":"Bonchi F, Gionis A, Gullo F, Ukkonen A (2014a) Distance oracles in edge-labeled graphs. In: Proceedings of the international conference on extending database technology (EDBT), pp 547\u2013558"},{"key":"110176_CR3804","doi-asserted-by":"crossref","unstructured":"Bonchi F, Gullo F, Kaltenbrunner A, Volkovich Y (2014b) Core decomposition of uncertain graphs. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 1316\u20131325","DOI":"10.1145\/2623330.2623655"},{"issue":"4","key":"110176_CR3805","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2728170","volume":"9","author":"Francesco Bonchi","year":"2015","unstructured":"Bonchi F, Gionis A, Gullo F, Tsourakakis CE, Ukkonen A (2015) Chromatic correlation clustering. ACM Trans Knowledge Discov Data 9(4):34","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"110176_CR3806","doi-asserted-by":"publisher","first-page":"11,150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2007) MEDUSA - new model of internet topology using k-shell decomposition. Proc Nat Acad Sci 104:11,150\u201311,154","journal-title":"Proc Nat Acad Sci"},{"key":"110176_CR3807","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, Ozsu MT (2011) Efficient core decomposition in massive networks. In: Proceedings of the IEEE international conference on data engineering (ICDE), pp 51\u201362","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"110176_CR3808","doi-asserted-by":"crossref","unstructured":"Cheng Y, Lu C, Wang N (2013) Local k-core clustering for gene networks. In: Proceedings of the IEEE international conference on bioinformatics and biomedicine, pp 9\u201315","DOI":"10.1109\/BIBM.2013.6732603"},{"key":"110176_CR3809","doi-asserted-by":"crossref","unstructured":"Dasari NS, Ranjan D, Zubair M (2014) ParK: an efficient algorithm for k-core decomposition on multicore processors. In: Proceedings of the IEEE international conference on big data, pp 9\u201316","DOI":"10.1109\/BigData.2014.7004366"},{"issue":"4","key":"110176_CR3810","doi-asserted-by":"publisher","first-page":"040,601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"SN Dorogovtsev","year":"2006","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JFF (2006) k-Core organization of complex networks. Phys Rev Lett 96(4):040,601","journal-title":"Phys Rev Lett"},{"key":"110176_CR3811","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"David Eppstein","year":"2010","unstructured":"Eppstein D, L\u00f6ffler M, Strash D (2010) Listing all maximal cliques in sparse graphs in near-optimal time. In: Proceedings of the international symposium on algorithms and computation (ISAAC), pp 403\u2013414"},{"key":"110176_CR3812","unstructured":"Gaertler M, Patrignani M (2004) Dynamic analysis of the autonomous system graph. In: Proceedings of the international work on inter-domain performance and simulation, pp 13\u201324"},{"key":"110176_CR3813","doi-asserted-by":"crossref","unstructured":"Garcia D, Mavrodiev P, Schweitzer F (2013) Social resilience in online communities: the autopsy of friendster. In: Proceedings of ACM conference on online social networks (COSN), pp 39\u201350","DOI":"10.1145\/2512938.2512946"},{"key":"110176_CR3814","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Thilikos DM, Vazirgiannis M (2011) D-cores: measuring collaboration of directed graphs based on degeneracy. In: Proceedings of IEEE international conference on data mining (ICDM), pp 201\u2013210","DOI":"10.1109\/ICDM.2011.46"},{"key":"110176_CR3815","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Malliaros FD, Thilikos DM, Vazirgiannis M (2014) CoreCluster: a degeneracy based graph clustering framework. In: Proceedings of AAAI conference on artificial intelligence, pp 44\u201350","DOI":"10.1609\/aaai.v28i1.8731"},{"key":"110176_CR3816","doi-asserted-by":"publisher","first-page":"056101","DOI":"10.1103\/PhysRevE.73.056101","volume":"73","author":"AV Goltsev","year":"2006","unstructured":"Goltsev AV, Dorogovtsev SN, Mendes JFF (2006) k-core (bootstrap) percolation on complex networks: critical phenomena and nonlocal effects. Physical Review E 73:056101","journal-title":"Physical Review E"},{"key":"110176_CR3817","unstructured":"Healy J, Janssen J, Milios EE, Aiello W (2006) Characterization of graphs using degree cores. In: Proceedings of international work on algorithms and models for the Web-Graph (WAW), pp 137\u2013148"},{"key":"110176_CR3818","unstructured":"Khan A, Bonchi F, Gionis A, Gullo F (2014) Fast reliability search in uncertain graphs. In: Proceedings of international conference on extending database technology (EDBT), pp 535\u2013546"},{"key":"110176_CR3819","doi-asserted-by":"crossref","unstructured":"Khan A, Gullo F, Wohler T, Bonchi F (2015) Top-k reliable edge colors in uncertain graphs. In: Proceedings of the ACM international conference on information and knowledge management (CIKM), pp 1851\u20131854","DOI":"10.1145\/2806416.2806619"},{"issue":"1","key":"110176_CR3820","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 (2015) K-core decomposition of large networks on a single PC. Proc VLDB Endowment 9(1):13\u201323","journal-title":"Proc VLDB Endowment"},{"issue":"11","key":"110176_CR3821","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identifying influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"issue":"2","key":"110176_CR3822","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G Kortsarz","year":"1994","unstructured":"Kortsarz G, Peleg D (1994) Generating sparse 2-spanners. J Algorithms 17(2):222\u2013236","journal-title":"J Algorithms"},{"key":"110176_CR3823","unstructured":"Kyrola A, Blelloch G, Guestrin C (2012) GraphChi: Large-scale graph computation on just a PC. In: Proceedings of the USENIX conference on operating systems design and implementation (OSDI), pp 31\u201346"},{"key":"110176_CR3824","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-1-4419-6045-0_10","volume-title":"Managing and mining graph data","author":"VE Lee","year":"2010","unstructured":"Lee VE, Ruan N, Jin R, Aggarwal C (2010) A survey of algorithms for dense subgraph discovery. In: Managing and mining graph data. Springer, New York, pp 303\u2013336"},{"issue":"10","key":"110176_CR3825","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"R Li","year":"2014","unstructured":"Li R, Yu JX, Mao R (2014) Efficient core maintenance in large dynamic graphs. IEEE Trans Knowledge Data Eng 26(10):2453\u20132465","journal-title":"IEEE Trans Knowledge Data Eng"},{"issue":"1","key":"110176_CR3826","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","volume":"91","author":"T Luczak","year":"1991","unstructured":"Luczak T (1991) Size and connectivity of the k-core of a random graph. Discret Math 91(1):61\u201368","journal-title":"Discret Math"},{"key":"110176_CR3827","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"110176_CR3828","unstructured":"Malliaros FD, Papadopoulos AN, Vazirgiannis M (2016) Core decomposition in graphs: concepts, algorithms and applications. In: Proceedings of international conference on extending database technology (EDBT), pp 720\u2013721"},{"issue":"2","key":"110176_CR3829","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor A, Pellegrini FD, Miorandi D (2013) Distributed k-core decomposition. IEEE Trans Parallel Distribut Syst 24(2):288\u2013300","journal-title":"IEEE Trans Parallel Distribut Syst"},{"key":"110176_CR3830","doi-asserted-by":"crossref","unstructured":"O\u2019Brien MP, Sullivan BD (2014) Locally estimating core numbers. In: Proceedings of IEEE international conference on data mining (ICDM), pp 460\u2013469","DOI":"10.1109\/ICDM.2014.136"},{"issue":"3","key":"110176_CR3831","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Mining Knowledge Discov 24(3):515\u2013554","journal-title":"Data Mining Knowledge Discov"},{"issue":"3","key":"110176_CR3832","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2818182","volume":"40","author":"P Parchas","year":"2015","unstructured":"Parchas P, Gullo F, Papadias D, Bonchi F (2015) Uncertain graph processing through representative instances. ACM Trans Database Syst 40(3):20","journal-title":"ACM Trans Database Syst"},{"key":"110176_CR3833","doi-asserted-by":"crossref","unstructured":"Pei S, Makse HA (2013) Spreading dynamics in complex networks. J Stat Mech Theory Exper 12","DOI":"10.1088\/1742-5468\/2013\/12\/P12002"},{"key":"110176_CR3834","doi-asserted-by":"crossref","unstructured":"Rossi MG, Malliaros FD, Vazirgiannis M (2015) Spread it good, spread it fast: Identification of influential nodes in social networks. In: Proceedings of the internatinal conference on World Wide Web - Companion Volume (WWW Companion), pp 101\u2013102","DOI":"10.1145\/2740908.2742736"},{"key":"110176_CR3835","doi-asserted-by":"crossref","unstructured":"Ruchansky N, Bonchi F, Garc\u00eda-Soriano D, Gullo F, Kourtellis N (2015) The minimum wiener connector problem. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 1587\u20131602","DOI":"10.1145\/2723372.2749449"},{"issue":"6","key":"110176_CR3836","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 AE, Gedik B, Jacques-Silva G, Wu KL, \u00c7ataly\u00fcrek \u00dcV (2013) Streaming algorithms for k-core decomposition. Proc VLDB Endowment 6(6):433\u2013444","journal-title":"Proc VLDB Endowment"},{"issue":"3","key":"110176_CR3837","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00778-016-0423-8","volume":"25","author":"AE Sar\u00edy\u00fcce","year":"2016","unstructured":"Sar\u00edy\u00fcce AE, Gedik B, Jacques-Silva G, Wu KL, \u00c7ataly\u00fcrek \u00dcV (2016) Incremental k-core decomposition: algorithms and evaluation. VLDB J 25(3):425\u2013447","journal-title":"VLDB J"},{"issue":"3","key":"110176_CR3838","doi-asserted-by":"publisher","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 Networks 5(3):269\u2013287","journal-title":"Soc Networks"},{"key":"110176_CR3839","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 104\u2013112","DOI":"10.1145\/2487575.2487645"},{"key":"110176_CR3840","doi-asserted-by":"crossref","unstructured":"Wen D, Qin L, Zhang Y, Lin X, Yu JX (2016) I\/O efficient core graph decomposition at web scale. In: Proceedings of IEEE international conference on data engineering (ICDE)","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"110176_CR3841","doi-asserted-by":"crossref","unstructured":"Wu H, Cheng J, Lu Y, Ke Y, Huang Y, Yan D, Wu H (2015) Core decomposition in large temporal graphs. In: Proceedings of IEEE internation conference on big data, pp 649\u2013658","DOI":"10.1109\/BigData.2015.7363809"},{"issue":"2","key":"110176_CR3842","doi-asserted-by":"publisher","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(2):444\u2013449","journal-title":"Proteomics"},{"issue":"14","key":"110176_CR3843","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan D, Cheng J, Lu Y, Ng W (2014) Blogel: a block-centric framework for distributed computation on real-world graphs. Proc VLDB Endowment 7(14):1981\u20131992","journal-title":"Proc VLDB Endowment"},{"issue":"2","key":"110176_CR3844","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 (2010) Using the k-core decomposition to analyze the static structure of large-scale software systems. J Supercomput 53(2):352\u2013369","journal-title":"J Supercomput"}],"container-title":["Encyclopedia of Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-7131-2_110176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T13:35:50Z","timestamp":1661434550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-7131-2_110176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781493971305","9781493971312"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_110176","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}