{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:22Z","timestamp":1772119882999,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T00:00:00Z","timestamp":1590796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong RGC","award":["17217716 and 17200817"],"award-info":[{"award-number":["17217716 and 17200817"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>In this article, we design algorithms to maintain approximate core values in dynamic hypergraphs. This notion has been well studied for normal graphs in both static and dynamic setting. We generalize the problem to hypergraphs when edges can be inserted or deleted by an adversary.<\/jats:p>\n          <jats:p>We consider two dynamic scenarios. In the first case, there are only insertions; and in the second case, there can be both insertions and deletions. In either case, the update time is poly-logarithmic in the number of nodes, with the insertion-only case boasting a better approximation ratio. We also perform extensive experiments on large real-world datasets, which demonstrate the accuracy and efficiency of our algorithms.<\/jats:p>","DOI":"10.1145\/3385416","type":"journal-article","created":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T12:25:16Z","timestamp":1590841516000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Fully Dynamic Approximate k-Core Decomposition in Hypergraphs"],"prefix":"10.1145","volume":"14","author":[{"given":"Bintao","family":"Sun","sequence":"first","affiliation":[{"name":"The University of Hong Kong, Hong Kong SAR, China"}]},{"given":"T.-H. Hubert","family":"Chan","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong SAR, China"}]},{"given":"Mauro","family":"Sozio","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com ParisTech University, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2020,5,30]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2017. Facebook friendships network dataset \u2013 KONECT. Retrieved from http:\/\/konect.uni-koblenz.de\/networks\/facebook-wosn-links.  2017. Facebook friendships network dataset \u2013 KONECT. Retrieved from http:\/\/konect.uni-koblenz.de\/networks\/facebook-wosn-links."},{"key":"e_1_2_1_2_1","unstructured":"2018. CiteULike tag-publication bipartite network dataset. Retrieved from http:\/\/konect.uni-koblenz.de\/networks\/citeulike-ti.  2018. CiteULike tag-publication bipartite network dataset. Retrieved from http:\/\/konect.uni-koblenz.de\/networks\/citeulike-ti."},{"key":"e_1_2_1_3_1","unstructured":"2018. DBLP dataset. Retrieved from http:\/\/dblp.uni-trier.de\/xml\/.  2018. DBLP dataset. Retrieved from http:\/\/dblp.uni-trier.de\/xml\/."},{"key":"e_1_2_1_4_1","unstructured":"2018. YouTube social network dataset. Retrieved from http:\/\/konect.uni-koblenz.de\/networks\/youtube-u-growth.  2018. YouTube social network dataset. Retrieved from http:\/\/konect.uni-koblenz.de\/networks\/youtube-u-growth."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems. 41--50","author":"Alvarez-Hamelin J. Ignacio","year":"2005"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933267.2933299"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_2_1_8_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_2_1_10_1","article-title":"Spectral properties of hypergraph laplacian and approximation algorithms","volume":"65","author":"Hubert Chan T.-H.","year":"2018","journal-title":"Journal of the ACM"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052619"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13336-015-0016-6"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.46"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0060159"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132907"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_2_1_22_1","first-page":"2568","article-title":"An O(m) algorithm for cores decomposition of undirected hypergraph","volume":"34","author":"Leng Ming","year":"2013","journal-title":"Journal of Chinese Computer Systems"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504747"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 9th International Conference on Web and Social Media (ICWSM\u201915)","author":"Meladianos Polykarpos","year":"2015"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_2_1_30_1","unstructured":"Nikolaj Tatti and Aristides Gionis. 2015. Density-friendly graph decomposition. ACM Transactions on Knowledge Discovery from Data 1 1 (2015)1089--1099.  Nikolaj Tatti and Aristides Gionis. 2015. Density-friendly graph decomposition. ACM Transactions on Knowledge Discovery from Data 1 1 (2015)1089--1099."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti688"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/pmic.200400962"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.93"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385416","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3385416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:50Z","timestamp":1750199930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,30]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8,31]]}},"alternative-id":["10.1145\/3385416"],"URL":"https:\/\/doi.org\/10.1145\/3385416","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,30]]},"assertion":[{"value":"2019-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}