{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T11:14:12Z","timestamp":1784632452334,"version":"3.55.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T00:00:00Z","timestamp":1455494400000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00778-016-0423-8","type":"journal-article","created":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T10:28:29Z","timestamp":1455532109000},"page":"425-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":88,"title":["Incremental k-core decomposition: algorithms and evaluation"],"prefix":"10.1007","volume":"25","author":[{"given":"Ahmet Erdem","family":"Sar\u0131y\u00fcce","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bu\u011fra","family":"Gedik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriela","family":"Jacques-Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun-Lung","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,15]]},"reference":[{"key":"423_CR1","doi-asserted-by":"crossref","unstructured":"Aksu, H., Canim, M., Chang, Y., Korpeoglu, I., Ulusoy, O.: Distributed-Core View Materialization and Maintenance for Large Dynamic Graphs. Knowl Data Eng. IEEE Trans. 26(10), 2439\u20132452 (2014)","DOI":"10.1109\/TKDE.2013.2297918"},{"key":"423_CR2","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: k-Core decomposition: a tool for the visualization of large scale networks. In: The Computing Research Repository (CoRR), arXiv:abs\/cs\/0504107 (2005)"},{"key":"423_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Workshop on Algorithms and Models for the Web Graph (WAW), pp. 25\u201337 (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"423_CR4","doi-asserted-by":"crossref","unstructured":"Bader, G.D., Hogue, C.W.V.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinf. 4(1), 1\u201327 (2003). doi: 10.1186\/1471-2105-4-2","DOI":"10.1186\/1471-2105-4-2"},{"key":"423_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.: Clique relaxations in social network analysis: the maximum $$k$$ k -plex problem. Oper. Res. 59, 133\u2013142 (2011)","journal-title":"Oper. Res."},{"issue":"5439","key":"423_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"423_CR7","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. In: The Computing Research Repository (CoRR), arXiv:cs.DS\/0310049 (2003)"},{"issue":"2","key":"423_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.3934\/nhm.2008.3.277","volume":"3","author":"M Baur","year":"2008","unstructured":"Baur, M., Gaertler, M., G\u00f6rke, R., Krug, M., Wagner, D.: Augmenting k-core generation with preferential attachment. Netw. Heterog. Media 3(2), 277\u2013294 (2008)","journal-title":"Netw. Heterog. Media"},{"key":"423_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: SIAM International Conference on Data Mining (SDM) (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"423_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Ozsu, M.T.: Efficient core decomposition in massive networks. In: IEEE International Conference on Data Engineering (ICDE), pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"423_CR11","unstructured":"DIMACS. 10th DIMACS Implementation Challenge. http:\/\/www.cc.gatech.edu\/dimacs10"},{"key":"423_CR12","doi-asserted-by":"crossref","unstructured":"Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: k-core organization of complex networks. Phys. Rev. Lett. 96(4), 040601 (2006)","DOI":"10.1103\/PhysRevLett.96.040601"},{"key":"423_CR13","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: World Wide Web Conference (WWW), pp. 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"423_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Hajnal, A.: On chromatic number of graphs and set-systems. Acta Math. Hung. 17, 61\u201399 (1966)","journal-title":"Acta Math. Hung."},{"key":"423_CR15","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the Evolution of Random Graphs, pp. 17\u201361. Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary (1960)"},{"issue":"3\u20135","key":"423_CR16","first-page":"75","volume":"483","author":"S Fortunato","year":"2009","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 483(3\u20135), 75\u2013174 (2009)","journal-title":"Phys. Rep."},{"key":"423_CR17","unstructured":"Gaertler, M.: Dynamic analysis of the autonomous system graph. In: International Workshop on Inter-domain Performance and Simulation (IPS), pp. 13\u201324 (2004)"},{"key":"423_CR18","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: Measuring collaboration of directed graphs based on degeneracy. In: IEEE International Conference on Data Mining (ICDM), pp. 201\u2013210 (2011)","DOI":"10.1109\/ICDM.2011.46"},{"key":"423_CR19","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: Evaluating cooperation in communities with the $$k$$ k -core structure. In: International Conference on Advances in Social Network Analysis and Mining (ASONAM), pp. 87\u201393 (2011)","DOI":"10.1109\/ASONAM.2011.65"},{"key":"423_CR20","doi-asserted-by":"crossref","unstructured":"Healy, J., Janssen, J., Milios, E., Aiello, W.: Characterization of graphs using degree cores. In: Workshop on Algorithms and Models for the Web Graph (WAW), pp. 137\u2013148 (2006)","DOI":"10.1007\/978-3-540-78808-9_13"},{"issue":"2","key":"423_CR21","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. J. Algorithms 17(2), 222\u2013236 (1994)","journal-title":"J. Algorithms"},{"key":"423_CR22","unstructured":"Li, R.-H., Yu, J.X.: Efficient Core Maintenance in Large Dynamic Graphs. CoRR, arXiv:1207.4567 (2012)"},{"issue":"1","key":"423_CR23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","volume":"91","author":"T Luczak","year":"1991","unstructured":"Luczak, T.: Size and connectivity of the k-core of a random graph. Discrete Math. 91(1), 61\u201368 (1991)","journal-title":"Discrete Math."},{"key":"423_CR24","doi-asserted-by":"crossref","unstructured":"Nanavati, A.A., Siva, G., Das, G., Chakraborty, D., Dasgupta, K., Mukherjea, S., Joshi, A.: On the structural properties of massive telecom call graphs: findings and implications. In: ACM International Conference on Information and Knowledge Management (CIKM), pp. 435\u2013444 (2006)","DOI":"10.1145\/1183614.1183678"},{"key":"423_CR25","doi-asserted-by":"crossref","unstructured":"Ozgul, F., Erdem, Z., Bowerman, C., Atzenbeck, C.: Comparison of feature-based criminal network detection models with k-core and n-clique. In: International Conference on Advances in Social Network Analysis and Mining (ASONAM), pp: 400\u2013401 (2010)","DOI":"10.1109\/ASONAM.2010.45"},{"key":"423_CR26","doi-asserted-by":"crossref","unstructured":"Saito, H., Toyoda, M., Kitsuregawa, M., Aihara, K.: A large-scale study of link spam detection by graph algorithms. In: International Workshop on Adversarial Information Retrieval on the Web (AIRWeb), pp. 45\u201348 (2007)","DOI":"10.1145\/1244408.1244417"},{"issue":"1","key":"423_CR27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jmbi.1998.1689","volume":"279","author":"R Samudrala","year":"1998","unstructured":"Samudrala, R., Moult, J.: A graph-theoretic algorithm for comparative modeling of protein structure. J. Mol. Biol. 279(1), 287\u2013302 (1998)","journal-title":"J. Mol. Biol."},{"key":"423_CR28","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. In: Proceedings of the Very Large Data Bases Conference (PVLDB), pp. 433\u2013444 (2013)","DOI":"10.14778\/2536336.2536344"},{"issue":"3","key":"423_CR29","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(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"423_CR30","unstructured":"SNAP. Stanford network analysis package. http:\/\/snap.stanford.edu\/snap"},{"issue":"12","key":"423_CR31","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1002\/spe.993","volume":"40","author":"D Turaga","year":"2010","unstructured":"Turaga, D., Andrade, H., Gedik, B., Venkatramani, C., Verscheure, O., Harris, J.D., Cox, J., Szewczyk, W., Jones, P.: Design principles for developing stream processing applications. Softw. Pract. Exp. 40(12), 1073\u20131104 (2010)","journal-title":"Softw. Pract. Exp."},{"key":"423_CR32","unstructured":"Verma, A., Butenko, S.: Network clustering via clique relaxations: a community based approach. In: 10th DIMACS Implementation Challenge (2011)"},{"issue":"2","key":"423_CR33","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/pmic.200400962","volume":"5","author":"S Wuchty","year":"2005","unstructured":"Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics 5(2), 444\u2013449 (2005)","journal-title":"Proteomics"},{"key":"423_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: IEEE International Conference on Data Engineering (ICDE), pp. 1049\u20131060 (2012)","DOI":"10.1109\/ICDE.2012.35"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-016-0423-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-016-0423-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-016-0423-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T16:00:37Z","timestamp":1567612837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-016-0423-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,15]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["423"],"URL":"https:\/\/doi.org\/10.1007\/s00778-016-0423-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,15]]}}}