{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:21Z","timestamp":1773481761037,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030692438","type":"print"},{"value":"9783030692445","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69244-5_9","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:36:12Z","timestamp":1613838972000},"page":"104-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Distributed Algorithm for Truss Maintenance in Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Qi","family":"Luo","sequence":"first","affiliation":[]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive Quasi-Clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45995-2_51"},{"issue":"11","key":"9_CR2","first-page":"1298","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. PVLDB 10(11), 1298\u20131309 (2017)","journal-title":"PVLDB"},{"issue":"4","key":"9_CR3","first-page":"577","volume":"15","author":"Z Cai","year":"2018","unstructured":"Cai, Z., He, Z., Guan, X., Li, Y.: Collective data-sanitization for preventing sensitive information inference attacks in social networks. IEEE Trans. Dependable Secur. Comput. 15(4), 577\u2013590 (2018)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chen, P., Chou, C., Chen, M.: Distributed algorithms for k-truss decomposition. In: 2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, 27\u201330 October 2014, pp. 471\u2013480 (2014)","DOI":"10.1109\/BigData.2014.7004264"},{"key":"9_CR5","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Technical report. National Security Agency (2008)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a MapReduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009)","journal-title":"Comput. Sci. Eng."},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00778-019-00540-5","volume":"28","author":"A Das","year":"2019","unstructured":"Das, A., Svendsen, M., Tirthapura, S.: Incremental maintenance of maximal cliques in a dynamic graph. VLDB J. 28(3), 351\u2013375 (2019)","journal-title":"VLDB J."},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1109\/TPDS.2019.2960226","volume":"31","author":"Q Hua","year":"2020","unstructured":"Hua, Q., et al.: Faster parallel core maintenance algorithms in dynamic graphs. IEEE Trans. Parallel Distrib. Syst. 31(6), 1287\u20131300 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR9","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: International Conference on Management of Data, SIGMOD, Snowbird, UT, USA, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"4","key":"9_CR10","first-page":"276","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V.S., Yu, J.X., Cheng, H.: Approximate closest community search in networks. PVLDB 9(4), 276\u2013287 (2015)","journal-title":"PVLDB"},{"issue":"11","key":"9_CR11","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1109\/TPDS.2018.2835441","volume":"29","author":"H Jin","year":"2018","unstructured":"Jin, H., Wang, N., Yu, D., Hua, Q., Shi, X., Xie, X.: Core maintenance in dynamic graphs: a parallel approach based on matching. IEEE Trans. Parallel Distrib. Syst. 29(11), 2416\u20132428 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR12","doi-asserted-by":"crossref","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., 1\u201312 (2020)","DOI":"10.1109\/TCSS.2021.3064836"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-030-34980-6_2","volume-title":"Computational Data and Social Networks","author":"Q Luo","year":"2019","unstructured":"Luo, Q., et al.: Distributed core decomposition in probabilistic graphs. In: Tagarelli, A., Tong, H. (eds.) CSoNet 2019. LNCS, vol. 11917, pp. 16\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34980-6_2"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD, Indianapolis, Indiana, USA, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., Pellegrini, F.D., Miorandi, D.: Distributed k-core decomposition. IEEE Trans. Parallel Distrib. Syst. 24(2), 288\u2013300 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Rossi, M.G., Malliaros, F.D., Vazirgiannis, M.: Spread it good, spread it fast: identification of influential nodes in social networks. In: Proceedings of the 24th International Conference on World Wide Web Companion, WWW, pp. 101\u2013102. ACM (2015)","DOI":"10.1145\/2740908.2742736"},{"issue":"3","key":"9_CR17","first-page":"97","volume":"10","author":"AE Sariy\u00fcce","year":"2016","unstructured":"Sariy\u00fcce, A.E., Pinar, A.: Fast hierarchy construction for dense subgraphs. PVLDB 10(3), 97\u2013108 (2016)","journal-title":"PVLDB"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","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":"9_CR19","doi-asserted-by":"crossref","unstructured":"Shao, Y., Chen, L., Cui, B.: Efficient cohesive subgraphs detection in parallel. In: SIGMOD Conference, pp. 613\u2013624. ACM (2014)","DOI":"10.1145\/2588555.2593665"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Sheng, H., Zheng, Y., Ke, W., Yu, D., Xiong, Z.: Mining hard samples globally and efficiently for person re-identification. IEEE Internet Things J. PP(99), 1 (2020)","DOI":"10.1109\/JIOT.2020.2980549"},{"issue":"9","key":"9_CR21","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Wang, N., Yu, D., Jin, H., Qian, C., Xie, X., Hua, Q.: Parallel algorithm for core maintenance in dynamic graphs. In: Lee, K., Liu, L. (eds.) 37th IEEE International Conference on Distributed Computing Systems, ICDCS, pp. 2366\u20132371. IEEE Computer Society (2017)","DOI":"10.1109\/ICDCS.2017.288"},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.26599\/BDMA.2020.9020002","volume":"3","author":"D Yu","year":"2020","unstructured":"Yu, D., Zhang, L., Luo, Q., Cheng, X., Yu, J., Cai, Z.: Fast skyline community search in multi-valued networks. Big Data Anal. Mining 3(3), 171\u2013180 (2020)","journal-title":"Big Data Anal. Mining"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Unboundedness and efficiency of truss maintenance in evolving graphs. In: SIGMOD, pp. 1024\u20131041 (2019)","DOI":"10.1145\/3299869.3300082"},{"key":"9_CR25","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Zhang, Y.: Efficient truss maintenance in evolving networks. CoRR abs\/1402.2807 (2014)"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69244-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T09:16:55Z","timestamp":1671355015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69244-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692438","9783030692445"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69244-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcc.siat.ac.cn\/meeting\/pdcat-paap2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}