{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:25:09Z","timestamp":1757456709611},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2018CFB519"],"award-info":[{"award-number":["2018CFB519"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702435","61972291"],"award-info":[{"award-number":["61702435","61972291"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["12200917","12200817"],"award-info":[{"award-number":["12200917","12200817"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001839","name":"University Grants Committee","doi-asserted-by":"publisher","award":["C6030-18GF"],"award-info":[{"award-number":["C6030-18GF"]}],"id":[{"id":"10.13039\/501100001839","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11280-020-00843-6","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T14:06:13Z","timestamp":1605881173000},"page":"397-417","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel algorithms for parameter-free structural diversity search on graphs"],"prefix":"10.1007","volume":"24","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":[[2020,11,20]]},"reference":[{"key":"843_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"},{"issue":"1","key":"843_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3365676","volume":"14","author":"S Arifuzzaman","year":"2019","unstructured":"Arifuzzaman, S., Khan, M., Marathe, M.: Fast parallel algorithms for counting and listing triangles in big graphs. TKDD 14(1), 1\u201334 (2019)","journal-title":"TKDD"},{"key":"843_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks arXiv preprint cs\/0310049 (2003)"},{"key":"843_CR4","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":"843_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L., Qin, L.: Cohesive subgraph computation over large sparse graphs: algorithms, data structures, and programming techniques. Springer, Berlin (2018)","DOI":"10.1007\/978-3-030-03599-0"},{"key":"843_CR6","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":"843_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, H., Zhong, M., Wang, J., Qian, T.: Keyword search based mashup construction with guaranteed diversity. In: DEXA, pp 423\u2013433 (2019)","DOI":"10.1007\/978-3-030-27618-8_31"},{"key":"843_CR8","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":"843_CR9","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":"843_CR10","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":"843_CR11","unstructured":"Esfandiari, H., Lattanzi, S., Mirrokni, V.: Parallel and streaming algorithms for k-core decomposition. In: ICML, pp 1397\u20131406 (2018)"},{"issue":"12","key":"843_CR12","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proc. VLDB Endow. 9(12), 1233\u20131244 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"843_CR13","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1109\/TKDE.2018.2872982","volume":"31","author":"Y Fang","year":"2018","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. IEEE Trans. Knowl. Data Eng. 31(11), 2093\u20132107 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"843_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs 1\u201340. VLDB J 29(1), 353\u2013392 (2020)","journal-title":"VLDB J"},{"issue":"6","key":"843_CR15","doi-asserted-by":"publisher","first-page":"854","DOI":"10.14778\/3380750.3380756","volume":"13","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Yang, Y., Zhang, W., Lin, X., Cao, X.: Effective and efficient community search over large heterogeneous information networks. Proc VLDB Endow 13(6), 854\u2013867 (2020)","journal-title":"Proc VLDB Endow"},{"key":"843_CR16","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":"843_CR17","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":"843_CR18","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. Natl. Acad. Sci. 102(46), 16569\u201316572 (2005)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"843_CR19","doi-asserted-by":"crossref","unstructured":"Hou, J., Wang, S., Wu, G., Fu, G., Jia, S., Wang, Y., Li, B., Zhang, L.: Parallel strongly connected components detection with multi-partition on gpus. In: ICCS, pp 16\u201330. Springer (2019)","DOI":"10.1007\/978-3-030-22747-0_2"},{"issue":"13","key":"843_CR20","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"},{"issue":"3","key":"843_CR21","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":"3","key":"843_CR22","first-page":"29","volume":"39","author":"X Huang","year":"2016","unstructured":"Huang, X., Cheng, H., Yu, J. X.: Attributed community analysis: global and ego-centric views. IEEE Data Eng. Bull. 39(3), 29\u201340 (2016)","journal-title":"IEEE Data Eng. Bull."},{"key":"843_CR23","doi-asserted-by":"crossref","unstructured":"Huang, J., Huang, X., Zhu, Y., Xu, J.: Parameter-free structural diversity search. In: WISE, pp 677\u2013693 (2019)","DOI":"10.1007\/978-3-030-34223-4_43"},{"key":"843_CR24","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.2200\/S00928ED1V01Y201906DTM061"},{"key":"843_CR25","doi-asserted-by":"crossref","unstructured":"Huang, J., Huang, X., Xu, J.: Truss-based structural diversity search in large graphs. arXiv preprint arXiv:2007.05437 (2020)","DOI":"10.1109\/TKDE.2020.3027950"},{"key":"843_CR26","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":"843_CR27","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":"843_CR28","doi-asserted-by":"crossref","unstructured":"Jiang, J., Huang, X., Choi, B., Xu, J., Bhowmick, S. S., ppkws, L. X. u.: An efficient framework for keyword search on public-private networks. In: ICDE, pp 457\u2013468 (2020)","DOI":"10.1109\/ICDE48307.2020.00046"},{"issue":"4","key":"843_CR29","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s11280-018-0611-0","volume":"22","author":"J Jin","year":"2019","unstructured":"Jin, J., Luo, J., Khemmarat, S., Dong, F., Gao, L.: Gstar: an efficient framework for answering top-k star queries on billion-node knowledge graphs. World Wide Web 22(4), 1611\u20131638 (2019)","journal-title":"World Wide Web"},{"key":"843_CR30","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"},{"issue":"10","key":"843_CR31","first-page":"2658","volume":"27","author":"M-S Kim","year":"2015","unstructured":"Kim, M. -S., Lee, S., Han, W. -S., Park, H., Lee, J.-H.: Dsp-cc-: I\/o efficient parallel computation of connected components in billion-scale networks. ICDE 27(10), 2658\u20132671 (2015)","journal-title":"ICDE"},{"key":"843_CR32","unstructured":"Leskovec, J., Krevl, A: SNAP Datasets: Stanford large network dataset collection http:\/\/snap.stanford.edu\/data (2014)"},{"key":"843_CR33","doi-asserted-by":"crossref","unstructured":"Levorato, V.: Core decomposition in directed networks: Kernelization and strong connectivity. In: CompleNet, vol. 549, pp 129\u2013140 (2014)","DOI":"10.1007\/978-3-319-05401-8_13"},{"issue":"10","key":"843_CR34","first-page":"2453","volume":"26","author":"R Li","year":"2014","unstructured":"Li, R., Yu, J. X., Mao, R.: Efficient core maintenance in large dynamic graphs. TKDE 26(10), 2453\u20132465 (2014)","journal-title":"TKDE"},{"issue":"2","key":"843_CR35","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s11280-017-0513-6","volume":"22","author":"G Liu","year":"2019","unstructured":"Liu, G., Shi, Q., Zheng, K., Li, Z., Liu, A., Xu, J.: Context-aware graph pattern based top-k designated nodes finding in social graphs. World Wide Web 22(2), 751\u2013770 (2019)","journal-title":"World Wide Web"},{"key":"843_CR36","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: Vac: vertex-centric attributed community search. In: ICDE, pp 937\u2013948 (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"issue":"1","key":"843_CR37","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":"843_CR38","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"},{"key":"843_CR39","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: SOSP, pp 456\u2013471 (2013)","DOI":"10.1145\/2517349.2522739"},{"key":"843_CR40","doi-asserted-by":"crossref","unstructured":"Sanz-Cruzado, J., Pepa, S. M., Castells, P.: Structural novelty and diversity in link prediction. In: Companion Proceedings of the The Web Conference, vol. 2018, pp 1347\u20131351 (2018)","DOI":"10.1145\/3184558.3191576"},{"issue":"6","key":"843_CR41","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":"843_CR42","doi-asserted-by":"crossref","unstructured":"Shang, Z.J., Yu, X., Zhang, Z.: Tufast: a lightweight parallelization library for graph analytics. In: ICDE, pp 710\u2013721. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00069"},{"key":"843_CR43","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G. E.: Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp 135\u2013146 (2013)","DOI":"10.1145\/2517327.2442530"},{"key":"843_CR44","doi-asserted-by":"crossref","unstructured":"Smith, S., Liu, X., Ahmed, N.K., Tom, A.S., Petrini, F., Karypis, G.: Truss decomposition on shared-memory parallel systems. In: HPEC, pp 1\u20136. IEEE (2017)","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"843_CR45","doi-asserted-by":"crossref","unstructured":"Su, J., Kamath, K., Sharma, A., Ugander, J., Goel, S.: An experimental study of structural diversity in social networks. arXiv preprint arXiv:1909.03543 (2019)","DOI":"10.1609\/icwsm.v14i1.7332"},{"key":"843_CR46","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":"843_CR47","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"},{"key":"843_CR48","doi-asserted-by":"crossref","unstructured":"Wang, W., Gu, Y., Wang, Z., Yu, G.: Parallel triangle counting over large graphs. In: DASFAA, pp 301\u2013308. Springer (2013)","DOI":"10.1007\/978-3-642-37450-0_23"},{"issue":"6","key":"843_CR49","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/s00778-019-00576-7","volume":"28","author":"R Wang","year":"2019","unstructured":"Wang, R., Wang, S., Zhou, X.: Parallelizing approximate single-source personalized pagerank queries on shared memory. VLDBJ 28(6), 923\u2013940 (2019)","journal-title":"VLDBJ"},{"issue":"1","key":"843_CR50","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":"843_CR51","doi-asserted-by":"crossref","unstructured":"Wu, H., Cheng, J., Lu, Y., Ke, Y., Huang, Y., Yan, D., Wu, H.: Core decomposition in large temporal graphs. In: BigData, pp 649\u2013658 (2015)","DOI":"10.1109\/BigData.2015.7363809"},{"key":"843_CR52","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"},{"key":"843_CR53","unstructured":"Zhang, Y., Wang, L., Zhu, J. J., Wang, X., Pentland, A.: The strength of structural diversity in online social networks. arXiv preprint arXiv:1906.00756 (2019)"},{"key":"843_CR54","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, R., Yang, Q., Wang, G., Qin, L.: Efficient top-k edge structural diversity search. In: ICDE, pp 205\u2013216 (2020)","DOI":"10.1109\/ICDE48307.2020.00025"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00843-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-020-00843-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00843-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T02:22:45Z","timestamp":1669688565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-020-00843-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,20]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00843-6","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,20]]},"assertion":[{"value":"21 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}