{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:35:03Z","timestamp":1768109703309,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031466762","type":"print"},{"value":"9783031466779","type":"electronic"}],"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-46677-9_28","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"405-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Size-Constrained (k,\u00a0d)-Truss Community Search"],"prefix":"10.1007","author":[{"given":"Chuanyu","family":"Zong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengcheng","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anzhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-xiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Fang, Y., et al.: A survey of community search over big graphs. In: VLDB, pp. 353\u2013392 (2020)","DOI":"10.1007\/s00778-019-00556-x"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, J., Yu, P., Lv, Y.: Enterprise employee training via project team formation. In: WSDM, pp. 3\u201312 (2017)","DOI":"10.1145\/3018661.3018682"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. In: PNAS, pp. 5962\u20135966 (2012)","DOI":"10.1073\/pnas.1116502109"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Dittrich, M., Klau, G., Rosenwald, A., Dandekar, T., M\u00fcller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. In: ISMB, pp. i223\u2013i231 (2008)","DOI":"10.1093\/bioinformatics\/btn161"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Huang, X., Lakshmanan, L.: Attribute-driven community search. In: VLDB, pp. 949\u2013960 (2017)","DOI":"10.14778\/3099622.3099626"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. In: DMKD, pp. 1406\u20131433 (2015)","DOI":"10.1007\/s10618-015-0422-1"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: SIGMOD, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. In: VLDB, pp. 1298\u20131309 (2017)","DOI":"10.14778\/3137628.3137640"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, W., Lin, X., Zhang, Y.: Efficient community search with size constraint. In: ICDE, pp. 97\u2013108 (2021)","DOI":"10.1109\/ICDE51399.2021.00016"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Yao, K., Chang, L.: Efficient size-bounded community search over large networks. In: VLDB, pp. 1441\u20131453 (2021)","DOI":"10.14778\/3457390.3457407"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Li, C., Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Efficient progressive minimum k-core search. In: VLDB, pp. 362\u2013375 (2020)","DOI":"10.14778\/3368289.3368300"}],"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-46677-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:25:09Z","timestamp":1699104309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}