{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:17:12Z","timestamp":1779175032020,"version":"3.51.4"},"reference-count":170,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T00:00:00Z","timestamp":1572825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T00:00:00Z","timestamp":1572825600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00778-019-00587-4","type":"journal-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T03:02:44Z","timestamp":1572836564000},"page":"61-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":132,"title":["The core decomposition of networks: theory, algorithms and applications"],"prefix":"10.1007","volume":"29","author":[{"given":"Fragkiskos D.","family":"Malliaros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Giatsidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6172-354X","authenticated-orcid":false,"given":"Apostolos N.","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,4]]},"reference":[{"key":"587_CR1","first-page":"541","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"A Adiga","year":"2013","unstructured":"Adiga, A., Vullikanti, A.K.S.: How robust is the core of a network? In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) Machine Learning and Knowledge Discovery in Databases, pp. 541\u2013556. Springer, Berlin (2013)"},{"key":"587_CR2","volume-title":"Social Network Data Analytics","year":"2011","unstructured":"Aggarwal, C.C. (ed.): Social Network Data Analytics. Springer, Berlin (2011)"},{"key":"587_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data. Springer, Berlin (2010)"},{"issue":"11","key":"587_CR4","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.14778\/3137628.3137640","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. Proc. VLDB Endow. 10(11), 1298\u20131309 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.physa.2016.11.002","volume":"468","author":"MA Al-garadi","year":"2017","unstructured":"Al-garadi, M.A., Varathan, K.D., Ravana, S.D.: Identification of influential spreaders in online social networks using interaction weighted k-core decomposition method. Phys. A 468, 278\u2013288 (2017)","journal-title":"Phys. A"},{"key":"587_CR6","first-page":"04","volume":"18","author":"J Alvarez-Hamelin","year":"2005","unstructured":"Alvarez-Hamelin, J., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: K-core decomposition: a tool for the visualization of large scale networks. Adv. Neural Inf. Process. Syst. 18, 04 (2005)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"587_CR7","unstructured":"Alvarez-hamelin, J.I., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS\u201906: Advances in Neural Information Processing Systems, pp. 41\u201350 (2006)"},{"key":"587_CR8","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: k-core decomposition: a tool for the analysis of large scale internet graphs (2005)"},{"issue":"2","key":"587_CR9","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, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: $$k$$-core decomposition of internet graphs: Hierarchies, self-similarity and measurement biases. NHM 3(2), 371 (2008)","journal-title":"NHM"},{"key":"587_CR10","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: WAW, pp. 25\u201337 (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"issue":"4","key":"587_CR11","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Chen, J.: Learning a hidden graph using o( logn) queries per edge. J. Comput. Syst. Sci. 74(4), 546\u2013556 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"587_CR12","doi-asserted-by":"crossref","unstructured":"Aridhi, S., Brugnara, M., Montresor, A., Velegrakis, Y.: Distributed k-core decomposition and maintenance in large dynamic graphs. In: Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems, DEBS\u201916, New York, NY, pp. 161\u2013168. ACM (2016)","DOI":"10.1145\/2933267.2933299"},{"key":"587_CR13","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Berlin (2008)","edition":"2"},{"issue":"3","key":"587_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10707-014-0220-8","volume":"19","author":"J Bao","year":"2015","unstructured":"Bao, J., Zheng, Y., Wilkie, D., Mokbel, M.: Recommendations in location-based social networks: a survey. GeoInformatica 19(3), 525\u2013565 (2015)","journal-title":"GeoInformatica"},{"issue":"2009","key":"587_CR15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1609\/icwsm.v3i1.13937","volume":"8","author":"M Bastian","year":"2009","unstructured":"Bastian, M., Heymann, S., Jacomy, M., et al.: Gephi: an open source software for exploring and manipulating networks. ICWSM 8(2009), 361\u2013362 (2009)","journal-title":"ICWSM"},{"key":"587_CR16","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A., Zaver\u0161nik, M.: Partitioning approach to visualization of large graphs. In: International Symposium on Graph Drawing, pp. 90\u201397. Springer (1999)","DOI":"10.1007\/3-540-46648-7_9"},{"key":"587_CR17","unstructured":"Batagelj, V., Zaversnik, M.: Generalized cores. CoRR, cs.DS\/0202039 (2002)"},{"key":"587_CR18","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks (2003). arXiv:cs\/0310049"},{"issue":"6295","key":"587_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"key":"587_CR20","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/978-3-642-31585-5_40","volume-title":"Automata, Languages, and Programming","author":"Kshipra Bhawalkar","year":"2012","unstructured":"Bhawalkar, K., Kleinberg, J., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unraveling in social networks: the anchored $$k$$-core problem. In: ICALP\u201911: Proceedings of the 39th International Colloquium Conference on Automata, Languages, and Programming, pp. 440\u2013451 (2011)"},{"key":"587_CR21","doi-asserted-by":"crossref","first-page":"03","DOI":"10.1016\/j.neuroimage.2015.03.057","volume":"114","author":"M Bola","year":"2015","unstructured":"Bola, M., Sabel, B.: Dynamic reorganization of brain functional networks during cognition. NeuroImage 114, 03 (2015)","journal-title":"NeuroImage"},{"key":"587_CR22","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web, WWW\u201904, New York, NY, pp. 595\u2013602. ACM (2004)","DOI":"10.1145\/988672.988752"},{"key":"587_CR23","first-page":"1","volume-title":"Core Decomposition of Massive, Information-Rich Graphs","author":"F Bonchi","year":"2017","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A.: Core Decomposition of Massive, Information-Rich Graphs, pp. 1\u201311. Springer, New York (2017)"},{"key":"587_CR24","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: KDD, pp. 1316\u20131325 (2014)","DOI":"10.1145\/2623330.2623655"},{"key":"587_CR25","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Khan, A., Severini, L.: Distance-generalized core decomposition. In: Proceedings of the 2019 ACM SIGMOD International Conference on Management of Data (2019)","DOI":"10.1145\/3299869.3324962"},{"key":"587_CR26","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings 17th International Conference on Data Engineering, pp. 421\u2013430 (2001)"},{"issue":"1-7","key":"587_CR27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"Sergey Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the Seventh International Conference on World Wide Web 7, WWW7, pp. 107\u2013117. Elsevier Science Publishers B. V., Amsterdam (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"587_CR28","unstructured":"Brown, P., Feng, J.: Measuring user influence on twitter using modified k-shell decomposition. In: The Social Mobile Web, Volume WS-11-02 of AAAI Workshops. AAAI (2011)"},{"issue":"27","key":"587_CR29","doi-asserted-by":"crossref","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E.: A model of internet topology using $$k$$-shell decomposition. PNAS 104(27), 11150\u201311154 (2007)","journal-title":"PNAS"},{"key":"587_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-03599-0","volume-title":"Cohesive Subgraph Computation over Large Sparse Graphs","author":"L Chang","year":"2018","unstructured":"Chang, L., Qin, L.: Cohesive Subgraph Computation over Large Sparse Graphs. Springer, Berlin (2018)"},{"key":"587_CR31","first-page":"21","volume-title":"Lijun: Minimum Degree-Based Core Decomposition. Springer Series in the Data Sciences","author":"Q-L Chang","year":"2018","unstructured":"Chang, Q.-L.: Lijun: Minimum Degree-Based Core Decomposition. Springer Series in the Data Sciences, pp. 21\u201339. Springer, Berlin (2018)"},{"key":"587_CR32","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Ozsu, M.T.: Efficient core decomposition in massive networks. In: ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"587_CR33","unstructured":"Cheng, S.-T., Chen, Y.-C., Tsai, M.-S.: Using k-core decomposition to find cluster centers for k-means algorithm in graphx on spark. In: Proceedings of the 8-th International Conference on Cloud Computing, GRIDs, and Virtualization, pp. 93\u201398 (2017)"},{"key":"587_CR34","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. National Security Agency Technical Report (2008)"},{"key":"587_CR35","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1038\/srep02517","volume":"3","author":"P Colomer-de Sim\u00f3n","year":"2013","unstructured":"Colomer-de Sim\u00f3n, P., Serrano, M.A., Beir\u00f3, M.G., Alvarez-Hamelin, J.I., Bogun\u00e1, M.: Deciphering the global organization of clustering in real complex networks. Sci. Rep. 3, 2517 (2013)","journal-title":"Sci. Rep."},{"key":"587_CR36","doi-asserted-by":"crossref","DOI":"10.1002\/0470073047","volume-title":"Mining Graph Data","author":"DJ Cook","year":"2006","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. Wiley, Hoboken (2006)"},{"key":"587_CR37","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"587_CR38","doi-asserted-by":"crossref","unstructured":"Danisch, M., Chan, T.-H.H., Sozio, M.: Large scale density-friendly graph decomposition via convex programming. In: Proceedings of the 26th International Conference on World Wide Web, WWW\u201917, pp. 233\u2013242 (2017)","DOI":"10.1145\/3038912.3052619"},{"key":"587_CR39","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th Conference on Symposium on Operating Systems Design & Implementation\u2014Volume 6, OSDI\u201904, pp. 10\u201310. USENIX Association, Berkeley, CA (2004)"},{"key":"587_CR40","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM\u201917. New York, NY, pp. 2047\u20132050. ACM (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"587_CR41","doi-asserted-by":"crossref","first-page":"040601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"SN Dorogovtsev","year":"2006","unstructured":"Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: k-core organization of complex networks. Phys. Rev. Lett. 96, 040601 (2006)","journal-title":"Phys. Rev. Lett."},{"key":"587_CR42","unstructured":"Eidsaa, M.: Core decomposition analysis of weighted biological networks. Ph.D. thesis, NTNU (2016)"},{"key":"587_CR43","doi-asserted-by":"crossref","first-page":"062819","DOI":"10.1103\/PhysRevE.88.062819","volume":"88","author":"M Eidsaa","year":"2013","unstructured":"Eidsaa, M., Almaas, E.: $$s$$-core network decomposition: a generalization of $$k$$-core analysis to weighted networks. Phys. Rev. E 88, 062819 (2013)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"587_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13336-015-0016-6","volume":"5","author":"AI Emerson","year":"2015","unstructured":"Emerson, A.I., Andrews, S., Ahmed, I., Azis, T.K., Malek, J.A.: K-core decomposition of a protein domain co-occurrence network reveals lower cancer mutation rates for interior cores. J. Clin. Bioinform. 5(1), 1 (2015)","journal-title":"J. Clin. Bioinform."},{"issue":"1\u20132","key":"587_CR45","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P Erd\u00c5s","year":"1966","unstructured":"Erd\u00c5s, P., Hajnal, A.: On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hung. 17(1\u20132), 61\u201399 (1966)","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"6","key":"587_CR46","doi-asserted-by":"crossref","first-page":"709","DOI":"10.14778\/3055330.3055337","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. Proc. VLDB Endow. 10(6), 709\u2013720 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"587_CR47","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proc. VLDB Endow. 9(12), 1233\u20131244 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR48","doi-asserted-by":"crossref","unstructured":"Farach-Colton, M., Tsai, M.-T.: Computing the degeneracy of large graphs. In: Latin American Symposium on Theoretical Informatics, pp. 250\u2013260. Springer (2014)","DOI":"10.1007\/978-3-642-54423-1_22"},{"issue":"5","key":"587_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0195843","volume":"13","author":"HA Filho","year":"2018","unstructured":"Filho, H.A., Machicao, J., Bruno, O.M.: A hierarchical model of metabolic machinery based on the kcore decomposition of plant metabolic networks. PLoS ONE 13(5), 1\u201315 (2018)","journal-title":"PLoS ONE"},{"issue":"1","key":"587_CR50","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"1","key":"587_CR51","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-free search. J. ACM 29(1), 24\u201332 (1982)","journal-title":"J. ACM"},{"key":"587_CR52","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Barrat, A., Bonchi, F., Cattuto, C., Gullo, F.: Mining (maximal) span-cores from temporal networks. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 107\u2013116. ACM (2018)","DOI":"10.1145\/3269206.3271767"},{"key":"587_CR53","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Bonchi, F., Gullo, F.: Core decomposition and densest subgraph in multilayer networks. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM\u201917, New York, NY, pp. 1807\u20131816. ACM (2017)","DOI":"10.1145\/3132847.3132993"},{"issue":"8","key":"587_CR54","doi-asserted-by":"crossref","first-page":"083030","DOI":"10.1088\/1367-2630\/14\/8\/083030","volume":"14","author":"A Garas","year":"2012","unstructured":"Garas, A., Schweitzer, F., Havlin, S.: A $$k$$-shell decomposition method for weighted networks. New J. Phys. 14(8), 083030 (2012)","journal-title":"New J. Phys."},{"key":"587_CR55","doi-asserted-by":"crossref","unstructured":"Garcia, D., Mavrodiev, P., Schweitzer, F.: Social resilience in online communities: the autopsy of friendster. In: COSN\u201913: Proceedings of the First ACM Conference on Online Social Networks, pp. 39\u201350 (2013)","DOI":"10.1145\/2512938.2512946"},{"issue":"02","key":"587_CR56","first-page":"2018","volume":"1\u201311","author":"J Garcia-Algarra","year":"2018","unstructured":"Garcia-Algarra, J., Pastor, J., Mouronte, M.L., Galeano, J.: A structural approach to disentangle the visualization of bipartite biological networks. Complexity 1\u201311(02), 2018 (2018)","journal-title":"Complexity"},{"key":"587_CR57","unstructured":"Garcia-Algarra, J., Pastor, J.M.M., Mouronte, M.L., Galeano, J.: Bipartgraph: an interactive application to plot bipartite ecological networks. bioRxiv (2017)"},{"key":"587_CR58","doi-asserted-by":"crossref","first-page":"3321","DOI":"10.7717\/peerj.3321","volume":"5","author":"J Garc\u00eda-Algarra","year":"2017","unstructured":"Garc\u00eda-Algarra, J., Pastor, J., Iriondo, J., Galeano, J.: Ranking of critical species to preserve the functionality of mutualistic networks using the $$k$$-core decomposition. PeerJ 5, 3321 (2017)","journal-title":"PeerJ"},{"key":"587_CR59","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Berberich, K., Thilikos, D.M., Vazirgiannis, M.: Visual exploration of collaboration networks based on graph degeneracy. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1512\u20131515. ACM (2012)","DOI":"10.1145\/2339530.2339768"},{"key":"587_CR60","unstructured":"Giatsidis, C., Cautis, B., Maniu, S., Thilikos, D.M., Vazirgiannis, M.: Quantifying trust dynamics in signed graphs, the s-cores approach. In: Proceedings of the 2014 SIAM International Conference on Data Mining, Philadelphia, Pennsylvania, USA, April 24\u201326, 2014, pp. 668\u2013676 (2014)"},{"key":"587_CR61","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Malliaros, F.D., Thilikos, D.M., Vazirgiannis, M.: Corecluster: A degeneracy based graph clustering framework. In: AAAI\u201914: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 44\u201350 (2014)","DOI":"10.1609\/aaai.v28i1.8731"},{"key":"587_CR62","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. In: ICDM\u201911: Proceedings of the 11th IEEE International Conference on Data Mining, pp. 201\u2013210 (2011)","DOI":"10.1109\/ICDM.2011.46"},{"key":"587_CR63","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: Evaluating cooperation in communities with the $$k$$-core structure. In: ASONAM\u201911: Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, pp. 87\u201393 (2011)","DOI":"10.1109\/ASONAM.2011.65"},{"issue":"2","key":"587_CR64","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10115-012-0539-0","volume":"35","author":"C Giatsidis","year":"2013","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. 35(2), 311\u2013343 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"587_CR65","doi-asserted-by":"crossref","unstructured":"Govindan, P., Soundarajan, S., Eliassi-Rad, T., Faloutsos, C.: Nimblecore: A space-efficient external memory algorithm for estimating core numbers. In: ASONAM, pp. 207\u2013214. IEEE Computer Society (2016)","DOI":"10.1109\/ASONAM.2016.7752237"},{"key":"587_CR66","doi-asserted-by":"crossref","unstructured":"Govindan, P., Wang, C., Xu, C., Duan, H., Soundarajan, S.: The $$k$$-peak decomposition: mapping the global structure of graphs. In: Proceedings of the 26th International Conference on World Wide Web, WWW\u201917, pp. 1441\u20131450 (2017)","DOI":"10.1145\/3038912.3052635"},{"issue":"7","key":"587_CR67","doi-asserted-by":"crossref","first-page":"e159","DOI":"10.1371\/journal.pbio.0060159","volume":"6","author":"P Hagmann","year":"2008","unstructured":"Hagmann, P., Cammoun, L., Gigandet, X., Meuli, R., Honey, C.J., Sporns, O.: Mapping the structural core of human cerebral cortex. PLoS Biol. 6(7), e159 (2008)","journal-title":"PLoS Biol."},{"key":"587_CR68","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.physa.2014.11.022","volume":"421","author":"X He","year":"2015","unstructured":"He, X., Zhao, H., Cai, W., Li, G.-G., Pei, F.-D.: Analyzing the structure of earthquake network by $$k$$-core decomposition. Phys. A 421, 34\u201343 (2015)","journal-title":"Phys. A"},{"key":"587_CR69","doi-asserted-by":"crossref","unstructured":"Healy, J., Janssen, J., Milios, E., Aiello, W.: Characterization of graphs using degree cores. In: WAW\u201908: Algorithms and Models for the Web-Graph, pp. 137\u2013148 (2008)","DOI":"10.1007\/978-3-540-78808-9_13"},{"issue":"6","key":"587_CR70","doi-asserted-by":"crossref","first-page":"062820","DOI":"10.1103\/PhysRevE.88.062820","volume":"88","author":"L H\u00e9bert-Dufresne","year":"2013","unstructured":"H\u00e9bert-Dufresne, L., Allard, A., Young, J.-G., Dub\u00e9, L.J.: Percolation on random networks with arbitrary $$k$$-core structure. Phys. Rev. E 88(6), 062820 (2013)","journal-title":"Phys. Rev. E"},{"key":"587_CR71","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-319-65636-6_24","volume-title":"Advances in Intelligent Networking and Collaborative Systems","author":"X Hu","year":"2018","unstructured":"Hu, X., Liu, F., Srinivasan, V., Thomo, A.: $$k$$-core decomposition on giraph and GraphChi. In: Barolli, L., Woungang, I., Hussain, O.K. (eds.) Advances in Intelligent Networking and Collaborative Systems, pp. 274\u2013284. Springer, Cham (2018)"},{"key":"587_CR72","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: Proceedings of the 2016 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201916, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"issue":"4","key":"587_CR73","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s12038-015-9554-0","volume":"40","author":"AE Isaac","year":"2015","unstructured":"Isaac, A.E., Sinha, S.: Analysis of core-periphery organization in protein contact networks reveals groups of structurally and functionally critical residues. J. Biosci. 40(4), 683\u2013699 (2015)","journal-title":"J. Biosci."},{"key":"587_CR74","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Parallel $$k$$-core decomposition on multicore platforms. In: IPDPS Workshops, pp. 1482\u20131491. IEEE Computer Society (2017)","DOI":"10.1109\/IPDPSW.2017.151"},{"key":"587_CR75","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-319-57045-7_6","volume-title":"Algorithmic Aspects of Cloud Computing","author":"V Kassiano","year":"2017","unstructured":"Kassiano, V., Gounaris, A., Papadopoulos, A.N., Tsichlas, K.: Mining uncertain graphs: an overview. In: Sellis, T., Oikonomou, K. (eds.) Algorithmic Aspects of Cloud Computing, pp. 87\u2013116. Springer, Cham (2017)"},{"key":"587_CR76","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201903, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"587_CR77","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Venkatesh, S., Thomo, A.: K-core decomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"issue":"3","key":"587_CR78","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/S0097539793255709","volume":"25","author":"LM Kirousis","year":"1996","unstructured":"Kirousis, L.M., Thilikos, D.M.: The linkage of a graph. SIAM J. Comput. 25(3), 626\u2013647 (1996)","journal-title":"SIAM J. Comput."},{"key":"587_CR79","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljerosand, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6, 888 (2010)","journal-title":"Nat. Phys."},{"key":"587_CR80","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: The web as a graph. In: PODS (2000)","DOI":"10.1145\/335168.335170"},{"key":"587_CR81","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo: mining a social network with negative edges. In: Proceedings of the 18th International Conference on World Wide Web, WWW\u201909, New York, NY, USA, pp. 741\u2013750. ACM (2009)","DOI":"10.1145\/1526709.1526809"},{"key":"587_CR82","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., Luca, E.W.D., Albayrak, S.: Spectral analysis of signed graphs for clustering, prediction and visualization. In: SDM, pp. 559\u2013570. SIAM (2010)","DOI":"10.1137\/1.9781611972801.49"},{"issue":"4","key":"587_CR83","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469\u2013476 (1975)","journal-title":"J. ACM"},{"key":"587_CR84","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: Large-scale graph computation on just a pc. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201912, Berkeley, CA, USA, pp. 31\u201346. USENIX Association (2012)"},{"issue":"8","key":"587_CR85","doi-asserted-by":"crossref","first-page":"083013","DOI":"10.1088\/1367-2630\/18\/8\/083013","volume":"18","author":"N Lahav","year":"2016","unstructured":"Lahav, N., Ksherim, B., Ben-Simon, E., Maron-Katz, A., Cohen, R., Havlin, S.: K -shell decomposition reveals hierarchical cortical organization of the human brain. New J. Phys. 18(8), 083013 (2016)","journal-title":"New J. Phys."},{"key":"587_CR86","doi-asserted-by":"crossref","unstructured":"Laishram, R., Sariy\u00fcce, A.E., Eliassi-Rad, T., Pinar, A., Soundarajan, S.: Measuring and improving the core resilience of networks. In: Proceedings of the 2018 World Wide Web Conference, WWW\u201918, pp. 609\u2013618 (2018)","DOI":"10.1145\/3178876.3186127"},{"key":"587_CR87","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Horvitz, E.: Planetary-scale views on a large instant-messaging network. In: WWW\u201908: Proceedings of the 17th International Conference on World Wide Web, pp. 915\u2013924 (2008)","DOI":"10.1145\/1367497.1367620"},{"key":"587_CR88","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI\u201910, New York, NY, USA, pp. 1361\u20131370. ACM (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"587_CR89","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"587_CR90","doi-asserted-by":"crossref","unstructured":"Li, R., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 797\u2013808 (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"587_CR91","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Qin, L., Ye, F., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: Proceedings of the 2018 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201918, New York, NY, USA, pp. 457\u2013472. ACM (2018)","DOI":"10.1145\/3183713.3183736"},{"issue":"5","key":"587_CR92","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, J.X., Mao, R.: Influential community search in large networks. Proc. VLDB Endow. 8(5), 509\u2013520 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"587_CR93","doi-asserted-by":"crossref","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"R-H Li","year":"2014","unstructured":"Li, R.-H., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. IEEE Trans. Knowl. Data Eng. 26(10), 2453\u20132465 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"587_CR94","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: $$k$$-degenerate graphs. Can. J. Math. 22, 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"issue":"45","key":"587_CR95","doi-asserted-by":"crossref","first-page":"3279","DOI":"10.1016\/j.physleta.2014.09.054","volume":"378","author":"J-H Lin","year":"2014","unstructured":"Lin, J.-H., Guo, Q., Dong, W.-Z., Tang, L.-Y., Liu, J.-G.: Identifying the node spreading influence with largest $$k$$-core values. Phys. Lett. A 378(45), 3279\u20133284 (2014)","journal-title":"Phys. Lett. A"},{"key":"587_CR96","doi-asserted-by":"crossref","unstructured":"Litvak, M., Last, M.: Graph-based keyword extraction for single-document summarization. In: Proceedings of the Workshop on Multi-source Multilingual Information Extraction and Summarization, pp. 17\u201324. Association for Computational Linguistics (2008)","DOI":"10.3115\/1613172.1613178"},{"key":"587_CR97","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., Zhou, T.: Vital nodes identification in complex networks. Phys. Rep. 650, 1\u201363 (2016)","journal-title":"Phys. Rep."},{"key":"587_CR98","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Zhou, T., Zhang, Q.-M., Stanley, H.E.: The $$h$$-index of a network node and its relation to degree and coreness. Nat. Commun. 7, 10168 (2016)","journal-title":"Nat. Commun."},{"issue":"Suppl 4","key":"587_CR99","doi-asserted-by":"crossref","first-page":"s8","DOI":"10.1186\/1471-2105-10-S4-S8","volume":"10","author":"F Luo","year":"2009","unstructured":"Luo, F., Li, B., Wan, X.-F., Scheuermann, R.H.: Core and periphery structures in protein interaction networks. BMC Bioinform. 10(Suppl 4), s8 (2009)","journal-title":"BMC Bioinform."},{"key":"587_CR100","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201910, New York, NY, USA, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"587_CR101","unstructured":"Malliaros, F.D., Papadopoulos, A.N., Vazirgiannis, M.: Core decomposition in graphs: concepts, algorithms and applications. In: EDBT. OpenProceedings.org, pp. 720\u2013721 (2016)"},{"key":"587_CR102","doi-asserted-by":"crossref","first-page":"19307","DOI":"10.1038\/srep19307","volume":"6","author":"FD Malliaros","year":"2016","unstructured":"Malliaros, F.D., Rossi, M.-E.G., Vazirgiannis, M.: Locating influential nodes in complex networks. Sci. Rep. 6, 19307 (2016)","journal-title":"Sci. Rep."},{"key":"587_CR103","doi-asserted-by":"crossref","unstructured":"Malliaros, F.D., Vazirgiannis, M.: To stay or not to stay: modeling engagement dynamics in social graphs. In: 22nd ACM International Conference on Information and Knowledge Management, CIKM\u201913, pp. 469\u2013478 (2013)","DOI":"10.1145\/2505515.2505561"},{"issue":"6","key":"587_CR104","doi-asserted-by":"crossref","first-page":"68006","DOI":"10.1209\/0295-5075\/110\/68006","volume":"110","author":"FD Malliaros","year":"2015","unstructured":"Malliaros, F.D., Vazirgiannis, M.: Vulnerability assessment in social networks under cascade-based node departures. EPL (Eur. Lett.) 110(6), 68006 (2015)","journal-title":"EPL (Eur. Lett.)"},{"issue":"3","key":"587_CR105","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"587_CR106","doi-asserted-by":"crossref","unstructured":"Meladianos, P., Nikolentzos, G., Rousseau, F., Stavrakas, Y., Vazirgiannis, M.: Degeneracy-based real-time sub-event detection in twitter stream. In: ICWSM, pp. 248\u2013257 (2015)","DOI":"10.1609\/icwsm.v9i1.14597"},{"key":"587_CR107","doi-asserted-by":"crossref","unstructured":"Meladianos, P., Tixier, A., Nikolentzos, I., Vazirgiannis, M.: Real-time keyword extraction from conversations. In: Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Papers, pp. 462\u2013467 (2017)","DOI":"10.18653\/v1\/E17-2074"},{"key":"587_CR108","unstructured":"Mihalcea, R., Tarau, P.: Textrank: bringing order into text. In: Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing (2004)"},{"key":"587_CR109","doi-asserted-by":"crossref","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed k-core decomposition. In: PODC, pp. 207\u2013208 (2011)","DOI":"10.1145\/1993806.1993836"},{"issue":"2","key":"587_CR110","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., De Pellegrini, F., Miorandi, D.: Distributed $$k$$-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"587_CR111","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.physa.2018.10.035","volume":"516","author":"F Morone","year":"2019","unstructured":"Morone, F., Burleson-Lesser, K., Vinutha, H., Sastry, S., Makse, H.A.: The jamming transition is a $$k$$-core percolation transition. Phys. A 516, 172\u2013177 (2019)","journal-title":"Phys. A"},{"key":"587_CR112","first-page":"95","volume":"10","author":"F Morone","year":"2018","unstructured":"Morone, F., Ferraro, G., Makse, H.A.: The $$k$$-core as a predictor of structural collapse in mutualistic ecosystems. Nat. Phys. 10, 95\u2013102 (2018)","journal-title":"Nat. Phys."},{"key":"587_CR113","doi-asserted-by":"crossref","unstructured":"Nikolentzos, G., Meladianos, P., Limnios, S., Vazirgiannis, M.: A degeneracy framework for graph similarity. In: IJCAI, pp. 2595\u20132601 (2018)","DOI":"10.24963\/ijcai.2018\/360"},{"key":"587_CR114","doi-asserted-by":"crossref","unstructured":"O\u2019Brien, M.P., Sullivan, B.D.: Locally estimating core numbers. In: ICDM, pp. 460\u2013469 (2014)","DOI":"10.1109\/ICDM.2014.136"},{"key":"587_CR115","doi-asserted-by":"crossref","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 967\u2013978 (2014)","DOI":"10.1145\/2588555.2593668"},{"issue":"3","key":"587_CR116","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1145\/2818182","volume":"40","author":"P Parchas","year":"2015","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: Uncertain graph processing through representative instances. ACM Trans. Database Syst. 40(3), 20:1\u201320:39 (2015)","journal-title":"ACM Trans. Database Syst."},{"issue":"14","key":"587_CR117","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"12","key":"587_CR118","doi-asserted-by":"crossref","first-page":"P12002","DOI":"10.1088\/1742-5468\/2013\/12\/P12002","volume":"2013","author":"S Pei","year":"2013","unstructured":"Pei, S., Makse, H.A.: Spreading dynamics in complex networks. J. Stat. Mech. Theory Exp. 2013(12), P12002 (2013)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"587_CR119","doi-asserted-by":"crossref","first-page":"5547","DOI":"10.1038\/srep05547","volume":"4","author":"S Pei","year":"2014","unstructured":"Pei, S., Muchnik, L., Andrade Jr., J.S., Zheng, Z., Makse, H.A.: Searching for superspreaders of information in real-world social media. Sci. Rep. 4, 5547 (2014)","journal-title":"Sci. Rep."},{"issue":"12","key":"587_CR120","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1186\/s12859-016-1191-6","volume":"17","author":"M Pellegrini","year":"2016","unstructured":"Pellegrini, M., Baglioni, M., Geraci, F.: Protein complex prediction for large protein protein interaction networks with the core & peel method. BMC Bioinform. 17(12), 372 (2016)","journal-title":"BMC Bioinform."},{"key":"587_CR121","doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhang, Y., Zhang, W., Lin, X., Qin, L.: Efficient probabilistic $$k$$-core computation on uncertain graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1192\u20131203 (2018)","DOI":"10.1109\/ICDE.2018.00110"},{"issue":"1","key":"587_CR122","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1128\/MMBR.59.1.94-123.1995","volume":"59","author":"EM Phizicky","year":"1995","unstructured":"Phizicky, E.M., Fields, S.: Protein-protein interactions: methods for detection and analysis. Microbiol. Rev. 59(1), 94\u2013123 (1995)","journal-title":"Microbiol. Rev."},{"issue":"1-2","key":"587_CR123","doi-asserted-by":"crossref","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"Michalis Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. In: Proceedings of the VLDB Endowment, pp. 997\u20131008 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"587_CR124","first-page":"382","volume-title":"Lecture Notes in Computer Science","author":"Fran\u00e7ois Rousseau","year":"2015","unstructured":"Rousseau, F., Vazirgiannis, M.: Main core retention on graph-of-words for single-document keyword extraction. In: ECIR\u201915: Proceedings of the 37th European Conference on Information Retrieval, pp. 382\u2013393 (2015)"},{"issue":"4","key":"587_CR125","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pcbi.1003557","volume":"10","author":"D Samu","year":"2014","unstructured":"Samu, D., Seth, A.K., Nowotny, T.: Influence of wiring cost on the large-scale architecture of human cortical connectivity. PLOS Comput. Biol. 10(4), 1\u201324 (2014)","journal-title":"PLOS Comput. Biol."},{"issue":"3","key":"587_CR126","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s00778-016-0423-8","volume":"25","author":"AE Sar\u0131y\u00fcce","year":"2016","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Incremental $$k$$-core decomposition: algorithms and evaluation. VLDB J. 25(3), 425\u2013447 (2016)","journal-title":"VLDB J."},{"issue":"6","key":"587_CR127","doi-asserted-by":"crossref","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., \u00c7ataly\u00fcrek, U.V.: Streaming algorithms for $$k$$-core decomposition. Proc. VLDB Endow. 6(6), 433\u2013444 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR128","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM, pp. 504\u2013512 (2018)","DOI":"10.1145\/3159652.3159678"},{"issue":"1","key":"587_CR129","doi-asserted-by":"crossref","first-page":"43","DOI":"10.14778\/3275536.3275540","volume":"12","author":"AE Sariy\u00fcce","year":"2018","unstructured":"Sariy\u00fcce, A.E., Seshadhri, C., Pinar, A.: Local algorithms for hierarchical dense subgraph discovery. Proc. VLDB Endow. 12(1), 43\u201356 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR130","doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A., Catalyurek, U.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: Proceedings of the 24th International Conference on World Wide Web, WWW\u201915, pp. 927\u2013937 (2015)","DOI":"10.1145\/2736277.2741640"},{"key":"587_CR131","doi-asserted-by":"crossref","unstructured":"Sarkar, S., Bhagwat, A., Mukherjee, A.: Core2vec: a core-preserving feature learning framework for networks. In: IEEE\/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018, pp. 487\u2013490 (2018)","DOI":"10.1109\/ASONAM.2018.8508693"},{"issue":"2","key":"587_CR132","doi-asserted-by":"crossref","first-page":"022310","DOI":"10.1103\/PhysRevE.99.022310","volume":"99","author":"C Schmidt","year":"2019","unstructured":"Schmidt, C., Pfister, H.D., Zdeborov\u00e1, L.: Minimal sets to destroy the k-core in random networks. Phys. Rev. E 99(2), 022310 (2019)","journal-title":"Phys. Rev. E"},{"key":"587_CR133","doi-asserted-by":"crossref","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. Soc. Netw. 5, 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"587_CR134","doi-asserted-by":"crossref","unstructured":"Shailaja Dasari, N., Ranjan, D., Zubair, M.: Park: An efficient algorithm for k-core decomposition on multicore processors. Proceedings\u20142014 IEEE International Conference on Big Data, IEEE Big Data 2014, pp. 9\u201316 (2015)","DOI":"10.1109\/BigData.2014.7004366"},{"key":"587_CR135","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3389\/fncom.2013.00089","volume":"7","author":"M Shanahan","year":"2013","unstructured":"Shanahan, M., Bingman, V., Shimizu, T., Wild, M., G\u00fcnt\u00fcrk\u00fcn, O.: Large-scale network organization in the avian forebrain: a connectivity matrix and theoretical analysis. Front. Comput. Neurosci. 7, 89 (2013)","journal-title":"Front. Comput. Neurosci."},{"key":"587_CR136","doi-asserted-by":"crossref","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: Corescope: Graph mining using k-core analysis\u2014patterns, anomalies and algorithms. In: ICDM, pp. 469\u2013478. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0058"},{"issue":"3","key":"587_CR137","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s10115-017-1077-6","volume":"54","author":"K Shin","year":"2018","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: Patterns and anomalies in k-cores of real-world graphs with applications. Knowl. Inf. Syst. 54(3), 677\u2013710 (2018)","journal-title":"Knowl. Inf. Syst."},{"key":"587_CR138","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining\u2014KDD\u201910, pp. 939\u2013948. Exported from https:\/\/app.dimensions.ai on 27 April 2019 (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"587_CR139","unstructured":"Strouthopoulos, P., Papadopoulos, A.N.: Core discovery in hidden graphs. CoRR (to appear in Data and Knowledge Engineering). arXiv:1712.02827 (2017)"},{"key":"587_CR140","doi-asserted-by":"crossref","unstructured":"Tao, Y., Sheng, C., Li, J.: Finding maximum degrees in hidden bipartite graphs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201910, New York, NY, USA, pp. 891\u2013902. ACM (2010)","DOI":"10.1145\/1807167.1807263"},{"key":"587_CR141","doi-asserted-by":"crossref","unstructured":"Tatti, N., Gionis, A.: Density-friendly graph decomposition. In: WWW, pp. 1089\u20131099 (2015)","DOI":"10.1145\/2736277.2741119"},{"issue":"5500","key":"587_CR142","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., De Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319\u20132323 (2000)","journal-title":"Science"},{"key":"587_CR143","doi-asserted-by":"crossref","unstructured":"Tixier, A., Malliaros, F.D., Vazirgiannis, M.: A graph degeneracy-based approach to keyword extraction. In: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 1860\u20131870. Association for Computational Linguistics (2016)","DOI":"10.18653\/v1\/D16-1191"},{"key":"587_CR144","doi-asserted-by":"crossref","unstructured":"Tixier, A., Skianis, K., Vazirgiannis, M.: Gowvis: a web application for graph-of-words-based text visualization and summarization. In: Proceedings of ACL-2016 System Demonstrations, pp. 151\u2013156 (2016)","DOI":"10.18653\/v1\/P16-4026"},{"key":"587_CR145","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: Doulion: counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 837\u2013846. ACM (2009)","DOI":"10.1145\/1557019.1557111"},{"key":"587_CR146","unstructured":"Ugander, J., Karrer, B., Backstrom, L., Marlow, C.: The anatomy of the facebook social graph. arXiv:1111.4503 . Comment: 17 pp., 9 figures, 1 table (2011)"},{"issue":"44","key":"587_CR147","doi-asserted-by":"crossref","first-page":"15775","DOI":"10.1523\/JNEUROSCI.3539-11.2011","volume":"31","author":"MP van den Heuvel","year":"2011","unstructured":"van den Heuvel, M.P., Sporns, O.: Rich-club organization of the human connectome. J. Neurosci. 31(44), 15775\u201315786 (2011)","journal-title":"J. Neurosci."},{"key":"587_CR148","doi-asserted-by":"crossref","first-page":"10441","DOI":"10.1038\/ncomms10441","volume":"7","author":"T Verma","year":"2016","unstructured":"Verma, T., Russmann, F., Ara\u00fajo, N., Nagler, J., Herrmann, H.: Emergence of core-peripheries in networks. Nat. Commun. 7, 10441 (2016)","journal-title":"Nat. Commun."},{"issue":"4","key":"587_CR149","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"issue":"9","key":"587_CR150","doi-asserted-by":"crossref","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. Proc. VLDB Endow. 5(9), 812\u2013823 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR151","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 233\u2013244 (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"587_CR152","doi-asserted-by":"crossref","unstructured":"Wang, N., Yu, D., Jin, H., Qian, C., Xie, X., Hua, Q.: Parallel algorithm for core maintenance in dynamic graphs. In: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), vol. 00, pp. 2366\u20132371 (2017)","DOI":"10.1109\/ICDCS.2017.288"},{"key":"587_CR153","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/O efficient core graph decomposition at web scale. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 133\u2013144. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"issue":"1","key":"587_CR154","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TKDE.2018.2833070","volume":"31","author":"D Wen","year":"2019","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/o efficient core graph decomposition: application to degeneracy ordering. IEEE Trans. Knowl. Data Eng. 31(1), 75\u201390 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"587_CR155","volume-title":"Hadoop: The Definitive Guide","author":"T White","year":"2015","unstructured":"White, T.: Hadoop: The Definitive Guide, 4th edn. O\u2019Reilly, Sebastopol (2015)","edition":"4"},{"issue":"1","key":"587_CR156","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1186\/s13408-015-0027-4","volume":"5","author":"CI Wood","year":"2015","unstructured":"Wood, C.I., Hicks, I.V.: The minimal k-core problem for modeling k-assemblies. J. Math. Neurosci. (JMN) 5(1), 14 (2015)","journal-title":"J. Math. Neurosci. (JMN)"},{"key":"587_CR157","doi-asserted-by":"crossref","unstructured":"Wu, H., Cheng, J., Lu, Y., Ke, Y., Huang, Y., Yan, D., Wu, H.: Core decomposition in large temporal graphs. In: BigData, pp. 649\u2013658. IEEE (2015)","DOI":"10.1109\/BigData.2015.7363809"},{"issue":"14","key":"587_CR158","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.14778\/2733085.2733103","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: a block-centric framework for distributed computation on real-world graphs. Proc. VLDB Endow. 7(14), 1981\u20131992 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR159","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1109\/TKDE.2012.178","volume":"25","author":"ML Yiu","year":"2013","unstructured":"Yiu, M.L., Lo, E., Wang, J.: Identifying the most connected vertices in hidden bipartite graphs using group testing. IEEE Trans. Knowl. Data Eng. 25, 2245\u20132256 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"587_CR160","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/2934664","volume":"59","author":"M Zaharia","year":"2016","unstructured":"Zaharia, M., Xin, R.S., Wendell, P., Das, T., Armbrust, M., Dave, A., Meng, X., Rosen, J., Venkataraman, S., Franklin, M.J., Ghodsi, A., Gonzalez, J., Shenker, S., Stoica, I.: Apache spark: a unified engine for big data processing. Commun. ACM 59(11), 56\u201365 (2016)","journal-title":"Commun. ACM"},{"key":"587_CR161","doi-asserted-by":"crossref","first-page":"37954","DOI":"10.1038\/srep37954","volume":"6","author":"L Zdeborov\u00e1","year":"2016","unstructured":"Zdeborov\u00e1, L., Zhang, P., Zhou, H.-J.: Fast and simple decycling and dismantling of networks. Sci. Rep. 6, 37954 (2016)","journal-title":"Sci. Rep."},{"issue":"6","key":"587_CR162","doi-asserted-by":"crossref","first-page":"649","DOI":"10.14778\/3055330.3055332","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: Olak: an efficient algorithm to prevent unraveling in social networks. Proc. VLDB Endow. 10(6), 649\u2013660 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"587_CR163","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Finding critical users for social network engagement: the collapsed k-core problem. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 245\u2013251 (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"issue":"10","key":"587_CR164","doi-asserted-by":"crossref","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. Proc. VLDB Endow. 10(10), 998\u20131009 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"587_CR165","doi-asserted-by":"crossref","first-page":"123027+","DOI":"10.1088\/1367-2630\/10\/12\/123027","volume":"10","author":"G-Q Zhang","year":"2008","unstructured":"Zhang, G.-Q., Zhang, G.-Q., Yang, Q.-F., Cheng, S.-Q., Zhou, T.: Evolution of the Internet and its cores. New J. Phys. 10(12), 123027+ (2008)","journal-title":"New J. Phys."},{"key":"587_CR166","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: ICDE\u201912: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, pp. 1049\u20131060 (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"587_CR167","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 337\u2013348 (2017)","DOI":"10.1109\/ICDE.2017.93"},{"issue":"10","key":"587_CR168","doi-asserted-by":"crossref","first-page":"108902","DOI":"10.7498\/aps.62.108902","volume":"62","author":"R Zhuo-Ming","year":"2013","unstructured":"Zhuo-Ming, R., Jian-Guo, L., Feng, S., Zhao-Long, H., Qiang, G.: Analysis of the spreading influence of the nodes with minimum k-shell value in complex networks. Acta Phys. Sin. 62(10), 108902 (2013)","journal-title":"Acta Phys. Sin."},{"issue":"2","key":"587_CR169","doi-asserted-by":"crossref","first-page":"28005","DOI":"10.1209\/0295-5075\/97\/28005","volume":"97","author":"V Zlati\u0107","year":"2012","unstructured":"Zlati\u0107, V., Garlaschelli, D., Caldarelli, G.: Networks with arbitrary edge multiplicities. EPL (Europhys. Lett.) 97(2), 28005 (2012)","journal-title":"EPL (Europhys. Lett.)"},{"issue":"1","key":"587_CR170","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10115-016-0943-y","volume":"50","author":"Z Zou","year":"2017","unstructured":"Zou, Z., Zhu, R.: Truss decomposition of uncertain graphs. Knowl. Inf. Syst. 50(1), 197\u2013230 (2017)","journal-title":"Knowl. Inf. Syst."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00587-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00587-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00587-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T12:31:08Z","timestamp":1695385868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00587-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,4]]},"references-count":170,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["587"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00587-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,4]]},"assertion":[{"value":"31 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}