{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:29:24Z","timestamp":1773246564582,"version":"3.50.1"},"publisher-location":"New York, New York, USA","reference-count":24,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["NSF- CNS-1314603 NSF-IIS-1741197"],"award-info":[{"award-number":["NSF- CNS-1314603 NSF-IIS-1741197"]}]},{"name":"Sandia National Laboratories","award":["DE-NA-0003525"],"award-info":[{"award-number":["DE-NA-0003525"]}]},{"name":"Army Research Office","award":["W911NF-18-1-0047"],"award-info":[{"award-number":["W911NF-18-1-0047"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186127","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"609-618","source":"Crossref","is-referenced-by-count":24,"title":["Measuring and Improving the Core Resilience of Networks"],"prefix":"10.1145","author":[{"given":"Ricky","family":"Laishram","sequence":"first","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmet Erdem","family":"Sariy\u00fcce","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sucheta","family":"Soundarajan","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186127-1","unstructured":"Abhijin Adiga and Anil Kumar S. Vullikanti. 2013. How Robust Is the Core of a Network? Springer Berlin Heidelberg, Berlin, Heidelberg, 541--556."},{"key":"key-10.1145\/3178876.3186127-2","unstructured":"Md Altaf-Ul-Amine, Kensaku Nishikata, Toshihiro Korna, Teppei Miyasato, Yoko Shinbo, Md Arifuzzaman, Chieko Wada, Maki Maeda, Taku Oshima, Hirotada Mori, et al. 2003. Prediction of protein functions based on k-cores of proteinprotein interaction networks and amino acid sequences. Genome Informatics 14 (2003), 498--499."},{"key":"key-10.1145\/3178876.3186127-3","unstructured":"J. Ignacio Alvarez-Hamelin, Alain Barrat, and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In NIPS. 41--50."},{"key":"key-10.1145\/3178876.3186127-4","unstructured":"José Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2005. K-core decomposition of internet graphs: hierarchies, selfsimilarity and measurement biases. arXiv preprint cs\/0511007 (2005)."},{"key":"key-10.1145\/3178876.3186127-5","doi-asserted-by":"crossref","unstructured":"J. Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2008. K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases. Networks and Heterogeneous Media 3, 2 (2008), 371--293. http:\/\/cnet.fi.uba.ar\/ignacio.alvarez-hamelin\/pdf\/NHM_AH_D_B_V_2008.pdf","DOI":"10.3934\/nhm.2008.3.371"},{"key":"key-10.1145\/3178876.3186127-6","unstructured":"V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. Technical Report cs\/0310049. Arxiv."},{"key":"key-10.1145\/3178876.3186127-7","doi-asserted-by":"crossref","unstructured":"Francesco Bonchi, Francesco Gullo, Andreas Kaltenbrunner, and Yana Volkovich. 2014. Core Decomposition of Uncertain Graphs. In KDD. 1316--1325.","DOI":"10.1145\/2623330.2623655"},{"key":"key-10.1145\/3178876.3186127-8","doi-asserted-by":"crossref","unstructured":"Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, and Eran Shir. 2007. A model of Internet topology using k-shell decomposition. Proceedings of the National Academy of Sciences 104, 27 (2007), 11150--11154.","DOI":"10.1073\/pnas.0701175104"},{"key":"key-10.1145\/3178876.3186127-9","doi-asserted-by":"crossref","unstructured":"James Cheng, Yiping Ke, Shumo Chu, and M. Tamer Ozsu. 2011. Efficient Core Decomposition in Massive Networks. In ICDE. 51--62.","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"key-10.1145\/3178876.3186127-10","unstructured":"Sergey N Dorogovtsev, Alexander V Goltsev, and Jose Ferreira F Mendes. 2006. K-core organization of complex networks. Physical review letters 96, 4 (2006), 040601."},{"key":"key-10.1145\/3178876.3186127-11","doi-asserted-by":"crossref","unstructured":"P. Erd's and A. Hajnal. 1966. On chromatic number of graphs and set-systems. Acta Mathematica Hungarica 17 (1966), 61--99.","DOI":"10.1007\/BF02020444"},{"key":"key-10.1145\/3178876.3186127-12","doi-asserted-by":"crossref","unstructured":"Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. 2011. Evaluating Cooperation in Communities with the k-Core Structure. In ASONAM. 87--93.","DOI":"10.1109\/ASONAM.2011.65"},{"key":"key-10.1145\/3178876.3186127-13","doi-asserted-by":"crossref","unstructured":"Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. 2013. Dcores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. 35, 2 (2013), 311--343. https:\/\/doi.org\/10.1007\/s10115-012-0539-0","DOI":"10.1007\/s10115-012-0539-0"},{"key":"key-10.1145\/3178876.3186127-14","unstructured":"WU Jun, Mauricio Barahona, Tan Yue-Jin, and Deng Hong-Zhong. 2010. Natural connectivity of complex networks. Chinese physics letters 27, 7 (2010), 078902."},{"key":"key-10.1145\/3178876.3186127-15","doi-asserted-by":"crossref","unstructured":"Wissam Khaouid, Marina Barsky, S. Venkatesh, and Alex Thomo. 2015. K-Core Decomposition of Large Networks on a Single PC. PVLDB 9, 1 (2015), 13--23. http:\/\/www.vldb.org\/pvldb\/vol9\/p13-khaouid.pdf","DOI":"10.14778\/2850469.2850471"},{"key":"key-10.1145\/3178876.3186127-16","doi-asserted-by":"crossref","unstructured":"D. Matula and L. Beck. 1983. Smallest-last ordering and clustering and graph coloring algorithms. JACM 30, 3 (1983), 417--427.","DOI":"10.1145\/2402.322385"},{"key":"key-10.1145\/3178876.3186127-17","unstructured":"David. W. Matula. 1968. A min-max theorem for graphs with application to graph coloring. SIAM Rev. 10, 4 (1968), 481--482."},{"key":"key-10.1145\/3178876.3186127-18","doi-asserted-by":"crossref","unstructured":"Michael P. O'Brien and Blair D. Sullivan. 2014. Locally Estimating Core Numbers. In ICDM. 460--469.","DOI":"10.1109\/ICDM.2014.136"},{"key":"key-10.1145\/3178876.3186127-19","unstructured":"Chengbin Peng, Tamara G Kolda, and Ali Pinar. 2014. Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226 (2014)."},{"key":"key-10.1145\/3178876.3186127-20","doi-asserted-by":"crossref","unstructured":"Ahmet Erdem Sariyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, and Ü. V. Çatalyürek. 2013. Streaming Algorithms for K-core Decomposition. Proc. VLDB Endow. 6, 6 (April 2013), 433--444. https:\/\/doi.org\/10.14778\/2536336.2536344","DOI":"10.14778\/2536336.2536344"},{"key":"key-10.1145\/3178876.3186127-21","unstructured":"Stephen B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269--287."},{"key":"key-10.1145\/3178876.3186127-22","unstructured":"Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2016. CoreScope: Graph Mining Using k-Core Analysis Patterns, Anomalies and Algorithms. In Data Mining (ICDM), 2016 IEEE 16th International Conference on. IEEE, 469--478."},{"key":"key-10.1145\/3178876.3186127-23","doi-asserted-by":"crossref","unstructured":"D. Wen, L. Qin, Y. Zhang, X. Lin, and J. Yu. 2016. I\/O efficient Core Graph Decomposition at web scale. In ICDE. 133--144.","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"key-10.1145\/3178876.3186127-24","unstructured":"Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2017. Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4--9, 2017, San Francisco, California, USA. 245--251. http:\/\/aaai.org\/ocs\/index.php\/ AAAI\/AAAI17\/paper\/view\/14349"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186127","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186127&ftid=1957485&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186127"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186127","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}