{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:33:22Z","timestamp":1763202802728,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466700"},{"type":"electronic","value":"9783031466717"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46671-7_19","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T11:02:26Z","timestamp":1699095746000},"page":"277-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Common-Truss-Based Community Search on\u00a0Multilayer Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9196-4015","authenticated-orcid":false,"given":"Xudong","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9475-8944","authenticated-orcid":false,"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Behrouz, A., Hashemi, F., Lakshmanan, L.V.S.: Firmtruss community search in multilayer networks. arXiv preprint arXiv:2205.00742 (2022)","DOI":"10.14778\/3570690.3570700"},{"key":"19_CR2","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. National security agency Technical Report 16(3.1) (2008)"},{"key":"19_CR3","unstructured":"dblp (2011). http:\/\/en.wikipedia.org\/wiki\/DBLP"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"De Domenico, M., Porter, M.A., Arenas, A.: Muxviz: a tool for multilayer analysis and visualization of networks. J. Complex Netw. 3(2), 159\u2013176 (2015)","DOI":"10.1093\/comnet\/cnu038"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00778-017-0482-5","volume":"26","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Chen, Y., Luo, S., Jiafeng, H.: Effective and efficient attributed community search. VLDB J. 26, 803\u2013828 (2017)","journal-title":"VLDB J."},{"issue":"3\u20135","key":"19_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Bonchi, F., Gullo, F.: Core decomposition and densest subgraph in multilayer networks. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1807\u20131816 (2017)","DOI":"10.1145\/3132847.3132993"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Hashemi, F., Behrouz, A., Lakshmanan, L.V.S.: Firmcore decomposition of multilayer networks. In: Proceedings of the ACM Web Conference 2022, pp. 1589\u20131600 (2022)","DOI":"10.1145\/3485447.3512205"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Huang, H., Linghu, Q., Zhang, F., Ouyang, D., Yang, S.: Truss decomposition on multilayer graphs. In: 2021 IEEE International Conference on Big Data (Big Data), pp. 5912\u20135915. IEEE (2021)","DOI":"10.1109\/BigData52589.2021.9671831"},{"key":"19_CR10","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: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Kivel\u00e4, M., et al.: Multilayer networks. J. Complex Netw. 2(3), 203\u2013271 (2014)","DOI":"10.1093\/comnet\/cnu016"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Victor E., et al.: A survey of algorithms for dense subgraph discovery. In: Managing and Mining Graph Data, pp. 303\u2013336 (2010)","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 797\u2013808. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s11280-021-00890-7","volume":"25","author":"D Liu","year":"2022","unstructured":"Liu, D., Zou, Z.: On flexible cohesive subgraph mining. World Wide Web 25(2), 535\u2013567 (2022)","journal-title":"World Wide Web"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2183\u20132197 (2020)","DOI":"10.1145\/3318464.3380587"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lu, C., Yu, J.X., Wei, H., Zhang, Y.: Finding the maximum clique in massive graphs. Proc. VLDB Endowment 10(11), 1538\u20131549 (2017)","DOI":"10.14778\/3137628.3137660"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Lu, Z., Zhu, Y., Zhong, M., Yu, J.X.: On time-optimal (k, p)-core community search in dynamic graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 1396\u20131407. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00109"},{"key":"19_CR19","unstructured":"Roberts, N., Everton, S.: The noordin top terrorist network data (2011). http:\/\/www.thearda.com\/Archive\/Files\/Descriptions\/"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"issue":"9","key":"19_CR21","doi-asserted-by":"publisher","first-page":"4313","DOI":"10.1109\/TKDE.2020.3040762","volume":"34","author":"L Sun","year":"2020","unstructured":"Sun, L., Huang, X., Li, R.-H., Choi, B., Jianliang, X.: Index-based intimate-core community search in large weighted graphs. IEEE Trans. Knowl. Data Eng. 34(9), 4313\u20134327 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. arXiv preprint arXiv:1205.6693 (2012)","DOI":"10.14778\/2311906.2311909"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41019-017-0051-3","volume":"2","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Jian, X., Yang, Z., Li, J.: Query optimal k-plex based community in graphs. Data Sci. Eng. 2, 257\u2013273 (2017)","journal-title":"Data Sci. Eng."},{"key":"19_CR24","unstructured":"Yan, X., Han, J.: gspan: graph-based substructure pattern mining. In: Proceedings of 2002 IEEE International Conference on Data Mining, 2002, pp. 721\u2013724. IEEE (2002)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: Diversified coherent core search on multi-layer graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 701\u2013712. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00069"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46671-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T11:05:11Z","timestamp":1699095911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46671-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466700","9783031466717"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46671-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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":"43% - 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":"2.97","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":"3.77","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}