{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:43:29Z","timestamp":1742964209566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030342227"},{"type":"electronic","value":"9783030342234"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-34223-4_46","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:14:40Z","timestamp":1573690480000},"page":"728-744","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Algorithms for Intimate-Core Group Search in Weighted Graphs"],"prefix":"10.1007","author":[{"given":"Longxu","family":"Sun","sequence":"first","affiliation":[]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,29]]},"reference":[{"issue":"5","key":"46_CR1","first-page":"1406","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. DMKD 29(5), 1406\u20131433 (2015)","journal-title":"DMKD"},{"key":"46_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. arXiv preprint arXiv:cs\/0310049 (2003)"},{"issue":"3","key":"46_CR3","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unraveling in social networks: the anchored k-core problem. SIAM J. Discrete Math. 29(3), 1452\u20131475 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"9","key":"46_CR4","first-page":"1056","volume":"11","author":"F Bi","year":"2018","unstructured":"Bi, F., Chang, L., Lin, X., Zhang, W.: An optimal and progressive approach to online search of top-k influential communities. PVLDB 11(9), 1056\u20131068 (2018)","journal-title":"PVLDB"},{"key":"46_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms (2009)"},{"key":"46_CR6","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":"46_CR7","doi-asserted-by":"crossref","unstructured":"Duan, D., Li, Y., Jin, Y., Lu, Z.: Community mining on dynamic weighted directed graphs. In: ACM International Workshop on Complex Networks Meet Information & Knowledge Management, pp. 11\u201318 (2009)","DOI":"10.1145\/1651274.1651278"},{"issue":"6","key":"46_CR8","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., Hu, J.: Effective and efficient attributed community search. VLDBJ 26(6), 803\u2013828 (2017)","journal-title":"VLDBJ"},{"issue":"12","key":"46_CR9","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Fang, Y., et al.: A survey of community search over big graphs. arXiv preprint arXiv:1904.12539 (2019)","DOI":"10.1007\/s00778-019-00556-x"},{"key":"46_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, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"9","key":"46_CR12","first-page":"949","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang, X., Lakshmanan, L.V.: Attribute-driven community search. PVLDB 10(9), 949\u2013960 (2017)","journal-title":"PVLDB"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Huang, X., Lakshmanan, L.V., Xu, J.: Community Search over Big Graphs. Morgan & Claypool Publishers, San Rafael (2019)","DOI":"10.1007\/978-3-031-01874-9"},{"issue":"4","key":"46_CR14","first-page":"276","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. PVLDB 9(4), 276\u2013287 (2015)","journal-title":"PVLDB"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, W., Lakshmanan, L.V.: Truss decomposition of probabilistic graphs: semantics and algorithms. In: SIGMOD, pp. 77\u201390 (2016)","DOI":"10.1145\/2882903.2882913"},{"issue":"5","key":"46_CR16","first-page":"509","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Medya, S., Ma, T., Silva, A., Singh, A.: K-core minimization: a game theoretic approach. arXiv preprint arXiv:1901.02166 (2019)","DOI":"10.24963\/ijcai.2020\/480"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Newman, M.E.: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64(1), 016132 (2001)","DOI":"10.1103\/PhysRevE.64.016132"},{"issue":"5","key":"46_CR19","doi-asserted-by":"publisher","first-page":"056131","DOI":"10.1103\/PhysRevE.70.056131","volume":"70","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Analysis of weighted networks. Phys. Rev. E 70(5), 056131 (2004)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"46_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245\u2013251 (2010)","journal-title":"Soc. Netw."},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Ruchansky, N., Bonchi, F., Garc\u00eda-Soriano, D., Gullo, F., Kourtellis, N.: The minimum wiener connector problem. In: SIGMOD, pp. 1587\u20131602 (2015)","DOI":"10.1145\/2723372.2749449"},{"issue":"6","key":"46_CR22","first-page":"433","volume":"6","author":"AE Sar\u00edy\u00fcce","year":"2013","unstructured":"Sar\u00edy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. PVLDB 6(6), 433\u2013444 (2013)","journal-title":"PVLDB"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"issue":"9","key":"46_CR24","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"},{"issue":"2","key":"46_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. VLDBJ 25(2), 171\u2013196 (2016)","journal-title":"VLDBJ"},{"issue":"5","key":"46_CR26","first-page":"922","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. ICDE 30(5), 922\u2013935 (2017)","journal-title":"ICDE"},{"issue":"6","key":"46_CR27","first-page":"649","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, W., Zhang, Y., Qin, L., Lin, X.: OLAK: an efficient algorithm to prevent unraveling in social networks. PVLDB 10(6), 649\u2013660 (2017)","journal-title":"PVLDB"},{"key":"46_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Finding critical users for social network engagement: the collapsed k-core problem. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"46_CR29","doi-asserted-by":"crossref","unstructured":"Zheng, D., Liu, J., Li, R.-H., Aslay, C., Chen, Y.-C., Huang, X.: Querying intimate-core groups in weighted graphs. In: IEEE International Conference on Semantic Computing, pp. 156\u2013163 (2017)","DOI":"10.1109\/ICSC.2017.80"},{"key":"46_CR30","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2017.07.012","volume":"417","author":"Z Zheng","year":"2017","unstructured":"Zheng, Z., Ye, F., Li, R.-H., Ling, G., Jin, T.: Finding weighted k-truss communities in large networks. Inf. Sci. 417, 344\u2013360 (2017)","journal-title":"Inf. Sci."},{"key":"46_CR31","doi-asserted-by":"crossref","unstructured":"Zhu, W., Chen, C., Wang, X., Lin, X.: K-core minimization: an edge manipulation approach. In: CIKM, pp. 1667\u20131670 (2018)","DOI":"10.1145\/3269206.3269254"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34223-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:34:45Z","timestamp":1710336885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34223-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030342227","9783030342234"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34223-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"19 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2019.comp.polyu.edu.hk\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","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":"50","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":"24% - 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)"}},{"value":"WISE 2019 has been postponed until January 2020 because of the problems in Hong Kong. For CCIS volume, Submissions: 30. Full papers accepted: 10. Short papers accepted: 5.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}