{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:17:35Z","timestamp":1743103055673,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_44","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:33Z","timestamp":1739999913000},"page":"538-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Truss Maintenance Algorithms for\u00a0Dynamic Hypergraphs"],"prefix":"10.1007","author":[{"given":"Meng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Qiang-Sheng","family":"Hua","sequence":"additional","affiliation":[]},{"given":"Yefei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Zhiyuan","family":"Shao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10462-011-9250-x","volume":"38","author":"D Duan","year":"2012","unstructured":"Duan, D., Li, Y., Li, R., Lu, Z.: Incremental k-clique clustering in dynamic social networks. Artif. Intell. Rev. 38, 129\u2013147 (2012). https:\/\/doi.org\/10.1007\/s10462-011-9250-x","journal-title":"Artif. Intell. Rev."},{"key":"44_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"44_CR3","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Nat. Secur. Agency Tech. Rep. 16(3.1), 1\u201329 (2008)"},{"key":"44_CR4","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: WWW 2017, pp. 1441\u20131450 (2017)","DOI":"10.1145\/3038912.3052635"},{"key":"44_CR5","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: WWW 2015, pp. 927\u2013937 (2015)","DOI":"10.1145\/2736277.2741640"},{"issue":"6","key":"44_CR6","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TCSS.2020.3026574","volume":"7","author":"Q Luo","year":"2020","unstructured":"Luo, Q., Yu, D., Cheng, X., Cai, Z., Yu, J., Lv, W.: Batch processing for truss maintenance in large dynamic graphs. IEEE Trans. Comput. Soc. Syst. 7(6), 1435\u20131446 (2020)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Wang, X., Chen, Y., Zhang, Z., Qiao, P., Wang, G.: Efficient truss computation for large hypergraphs. In: WISE 2022, pp. 290\u2013305 (2022)","DOI":"10.1007\/978-3-031-20891-1_21"},{"issue":"7","key":"44_CR8","first-page":"3182","volume":"34","author":"Y Gu","year":"2020","unstructured":"Gu, Y., et al.: Distributed hypergraph processing using intersection graphs. IEEE Trans. Knowl. Data Eng. 34(7), 3182\u20133195 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"44_CR9","unstructured":"Wang, M., Hua, Q.-S., Wang, Y., Jin, H., Shao, Z.: Parallel truss maintenance algorithms for dynamic hypergraphs. https:\/\/qiangshenghua.github.io\/papers\/cocoon24full.pdf"},{"key":"44_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT press (2022)"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD 2014, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"3","key":"44_CR12","first-page":"707","volume":"72","author":"Q Luo","year":"2022","unstructured":"Luo, Q., Yu, D., Cheng, X., Sheng, H., Lyu, W.: Exploring truss maintenance in fully dynamic graphs: a mixed structure-based approach. IEEE Trans. Comput. 72(3), 707\u2013718 (2022)","journal-title":"IEEE Trans. Comput."},{"issue":"10168","key":"44_CR13","first-page":"1","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), 1\u20137 (2016)","journal-title":"Nat. Commun."},{"issue":"1","key":"44_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.14778\/3275536.3275540","volume":"12","author":"AE Sariyuce","year":"2018","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A.: Local algorithms for hierarchical dense subgraph discovery. Proc. VLDB Endowment 12(1), 43\u201356 (2018)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:46Z","timestamp":1739999926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}