{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T14:20:24Z","timestamp":1771078824421,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000163","name":"Division of Arctic Sciences","doi-asserted-by":"publisher","award":["DP160101513"],"award-info":[{"award-number":["DP160101513"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"Division of Arctic Sciences","doi-asserted-by":"publisher","award":["FT170100128"],"award-info":[{"award-number":["FT170100128"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"Division of Arctic Sciences","doi-asserted-by":"publisher","award":["DP180103096"],"award-info":[{"award-number":["DP180103096"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672235"],"award-info":[{"award-number":["61672235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["DP170101628"],"award-info":[{"award-number":["DP170101628"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["DP180103096"],"award-info":[{"award-number":["DP180103096"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of the Hong Kong SAR, China","award":["14221716"],"award-info":[{"award-number":["14221716"]}]},{"name":"Research Grants Council of the Hong Kong SAR, China","award":["12258116"],"award-info":[{"award-number":["12258116"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1109\/tkde.2018.2833070","type":"journal-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T19:11:41Z","timestamp":1525461101000},"page":"75-90","source":"Crossref","is-referenced-by-count":28,"title":["I\/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering"],"prefix":"10.1109","volume":"31","author":[{"given":"Dong","family":"Wen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6068-5062","authenticated-orcid":false,"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9738-827X","authenticated-orcid":false,"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.46"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.062819"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","article-title":"Greedy approximation algorithms for finding dense components in a\n graph","author":"charikar","year":"2000","journal-title":"Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization"},{"key":"ref32","first-page":"44","article-title":"Corecluster: A\n degeneracy based graph clustering framework","volume":"14","author":"giatsidis","year":"2014","journal-title":"AAAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"ref30","first-page":"250","article-title":"Computing the degeneracy of large graphs","author":"farach-colton","year":"2014","journal-title":"Proc 1st Latin Amer Symp Theoretical Informatics"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"ref10","first-page":"41","article-title":"Large scale networks\n fingerprinting and visualization using the k-core decomposition","author":"alvarez-hamelin","year":"2005","journal-title":"Proc 18th Int Conf Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.136"},{"key":"ref11","article-title":"k-core decomposition:\n A tool for the visualization of large scale networks","volume":"abs cs 504107","author":"alvarez-hamelin","year":"2005","journal-title":"CoRR"},{"key":"ref12","first-page":"498","article-title":"Prediction\n of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences","volume":"14","author":"altaf-ul-amine","year":"2003","journal-title":"Genome Informat"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0299-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.040601"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90162-U"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0036"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20147"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723740"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463703"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"ref6","article-title":"An o(m) algorithm for cores decomposition of networks","volume":"cs ds 310049","author":"batagelj","year":"2003","journal-title":"CoRR"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831366"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1090\/conm\/588\/11702","article-title":"Network clustering via clique relaxations: A community based approach","volume":"588","author":"verma","year":"2013","journal-title":"Graph Partitioning Graph Clustering"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"ref9","article-title":"How the k-core\n decomposition helps in understanding the internet topology","volume":"1","author":"alvarez-hamelin","year":"2006","journal-title":"ISMA Workshop on the Internet Topology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","article-title":"Finding dense subgraphs with size bounds","author":"andersen","year":"2009","journal-title":"Proc 5th Int Workshop Algorithms Models Web-Graph"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"ref42","first-page":"1082","article-title":"k-degenerate graphs","volume":"22","author":"lick","year":"1970","journal-title":"CJM"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78808-9_13"},{"key":"ref41","article-title":"A survey of algorithms for dense\n subgraph discovery","author":"lee","year":"2010","journal-title":"Managing and Mining Graph Data"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8566021\/08354806.pdf?arnumber=8354806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:11Z","timestamp":1657746851000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8354806\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":42,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2833070","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}