{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:32:05Z","timestamp":1757457125343,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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_43","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:14:40Z","timestamp":1573690480000},"page":"677-693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parameter-Free Structural Diversity Search"],"prefix":"10.1007","author":[{"given":"Jinbin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,29]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Aridhi, S., Brugnara, M., Montresor, A., Velegrakis, Y.: Distributed k-core decomposition and maintenance in large dynamic graphs. In: DEBS, pp. 161\u2013168. ACM (2016)","DOI":"10.1145\/2933267.2933299"},{"key":"43_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: KDD, pp. 1316\u20131325. ACM (2014)","DOI":"10.1145\/2623330.2623655"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Chang, L., Zhang, C., Lin, X., Qin, L.: Scalable top-k structural diversity search. In: ICDE, pp. 95\u201398 (2017)","DOI":"10.1109\/ICDE.2017.48"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-030-27618-8_31","volume-title":"Database and Expert Systems Applications","author":"H Cheng","year":"2019","unstructured":"Cheng, H., Zhong, M., Wang, J., Qian, T.: Keyword search based mashup construction with guaranteed diversity. In: Hartmann, S., K\u00fcng, J., Chakravarthy, S., Anderst-Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2019. LNCS, vol. 11707, pp. 423\u2013433. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27618-8_31"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"43_CR8","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1007\/s10489-018-1137-y","volume":"48","author":"F Ding","year":"2018","unstructured":"Ding, F., Zhuang, Y.: Ego-network probabilistic graphical model for discovering on-line communities. Appl. Intell. 48(9), 3038\u20133052 (2018)","journal-title":"Appl. Intell."},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Bonchi, F., Gullo, F.: Core decomposition and densest subgraph in multilayer networks. In: CIKM, pp. 1807\u20131816. ACM (2017)","DOI":"10.1145\/3132847.3132993"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: WWW, pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"issue":"46","key":"43_CR11","doi-asserted-by":"publisher","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch, J.E.: An index to quantify an individual\u2019s scientific research output. Proc. Nat. Acad. Sci. 102(46), 16569\u201316572 (2005)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"43_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00778-015-0379-0","volume":"24","author":"X Huang","year":"2015","unstructured":"Huang, X., Cheng, H., Li, R., Qin, L., Yu, J.X.: Top-k structural diversity search in large networks. VLDB J. 24(3), 319\u2013343 (2015)","journal-title":"VLDB J."},{"issue":"13","key":"43_CR13","first-page":"1618","volume":"6","author":"X Huang","year":"2013","unstructured":"Huang, X., Cheng, H., Li, R.-H., Qin, L., Yu, J.X.: Top-k structural diversity search in large networks. PVLDB 6(13), 1618\u20131629 (2013)","journal-title":"PVLDB"},{"key":"43_CR14","doi-asserted-by":"publisher","DOI":"10.2200\/S00928ED1V01Y201906DTM061","volume-title":"Community Search over Big Graphs","author":"X Huang","year":"2019","unstructured":"Huang, X., Lakshmanan, L.V., Xu, J.: Community Search over Big Graphs. Morgan & Claypool Publishers, San Rafael (2019)"},{"key":"43_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511664113","volume-title":"Citizens, Politics and Social Communication: Information and Influence in an Election Campaign","author":"RR Huckfeldt","year":"1995","unstructured":"Huckfeldt, R.R., Sprague, J.: Citizens, Politics and Social Communication: Information and Influence in an Election Campaign. Cambridge University Press, Cambridge (1995)"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Jakma, P., Orczyk, M., Perkins, C.S., Fayed, M.: Distributed k-core decomposition of dynamic graphs. In: StudentWorkshop@CoNEXT, pp. 39\u201340. ACM (2012)","DOI":"10.1145\/2413247.2413272"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"43_CR18","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"43_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-05401-8_13","volume-title":"Complex Networks V","author":"V Levorato","year":"2014","unstructured":"Levorato, V.: Core decomposition in directed networks: kernelization and strong connectivity. In: Contucci, P., Menezes, R., Omicini, A., Poncela-Casasnovas, J. (eds.) Complex Networks V. SCI, vol. 549, pp. 129\u2013140. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05401-8_13"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Li, R., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. In: TKDE, vol. 26, no. 10, pp. 2453\u20132465 (2014)","DOI":"10.1109\/TKDE.2013.158"},{"issue":"1","key":"43_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2556612","volume":"8","author":"J Mcauley","year":"2014","unstructured":"Mcauley, J., Leskovec, J.: Discovering social circles in ego networks. TKDD 8(1), 4 (2014)","journal-title":"TKDD"},{"issue":"2","key":"43_CR22","first-page":"288","volume":"24","author":"A Montresor","year":"2013","unstructured":"Montresor, A., Pellegrini, F.D., Miorandi, D.: Distributed k-core decomposition. TPDS 24(2), 288\u2013300 (2013)","journal-title":"TPDS"},{"issue":"6","key":"43_CR23","first-page":"433","volume":"6","author":"AE Sar\u0131y\u00fcce","year":"2013","unstructured":"Sar\u0131y\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":"43_CR24","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD Conference, pp. 1539\u20131554. ACM (2015)","DOI":"10.1145\/2723372.2723734"},{"issue":"16","key":"43_CR25","doi-asserted-by":"publisher","first-page":"5962","DOI":"10.1073\/pnas.1116502109","volume":"109","author":"J Ugander","year":"2012","unstructured":"Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. PNAS 109(16), 5962\u20135966 (2012)","journal-title":"PNAS"},{"issue":"1","key":"43_CR26","first-page":"75","volume":"31","author":"D Wen","year":"2019","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/O efficient core graph decomposition: application to degeneracy ordering. TKDE 31(1), 75\u201390 (2019)","journal-title":"TKDE"},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Wu, H., et al.: Core decomposition in large temporal graphs. In: BigData, pp. 649\u2013658 (2015)","DOI":"10.1109\/BigData.2015.7363809"},{"key":"43_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: ICDE, pp. 337\u2013348 (2017)","DOI":"10.1109\/ICDE.2017.93"}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:34:07Z","timestamp":1710336847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34223-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030342227","9783030342234"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34223-4_43","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)"}}]}}