{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:44:23Z","timestamp":1768920263223,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031534980","type":"print"},{"value":"9783031534997","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53499-7_23","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T20:03:01Z","timestamp":1709150581000},"page":"289-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Seeding Strategies for\u00a0the\u00a0Influence Maximization Problem"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Pablo Bonilla","family":"Ataides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rowena","family":"Kok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amyra","family":"Meidiana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A., Zaver\u0161nik, M.: Partitioning approach to visualization of large graphs. In: GD 1999, pp. 90\u201397 (1999)","DOI":"10.1007\/3-540-46648-7_9"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA 2014, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen, D., L\u00fc, L., Shang, M.S., Zhang, Y.C., Zhou, T.: Identifying influential nodes in complex networks. Phys. A 391(4), 1777\u20131787 (2012)","journal-title":"Phys. A"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: SIGKDD 2001, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Gui-sheng, Y., Ji-jie, W., Hong-bin, D., Jia, L.: Intelligent viral marketing algorithm over online social network. In: ICNDC 2011, pp. 319\u2013323 (2011)","DOI":"10.1109\/ICNDC.2011.69"},{"issue":"6","key":"23_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PLoS ONE 8(4), e59,613 (2013)","DOI":"10.1371\/journal.pone.0059613"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-31955-9_4","volume-title":"Network Analysis","author":"R Jacob","year":"2005","unstructured":"Jacob, R., Kosch\u00fctzki, D., Lehmann, K.A., Peeters, L., Tenfelde-Podehl, D.: Algorithms for centrality indices. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 62\u201382. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_4"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.bushor.2011.01.006","volume":"54","author":"AM Kaplan","year":"2011","unstructured":"Kaplan, A.M., Haenlein, M.: Two hearts in three-quarter time: how to waltz the social media\/viral marketing dance. Bus. Horiz. 54(3), 253\u2013263 (2011)","journal-title":"Bus. Horiz."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: SIGKDD 2003, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: ICALP 2005, pp. 1127\u20131138 (2005)","DOI":"10.1007\/11523468_91"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11(4), 105\u2013147 (2015)","journal-title":"Theory Comput."},{"issue":"11","key":"23_CR14","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web (TWEB) 1(1), 5\u2013es (2007)","DOI":"10.1145\/1232722.1232727"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: SIGKDD 2007, KDD 2007, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"issue":"1","key":"23_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0001-8","volume":"6","author":"JG Liu","year":"2016","unstructured":"Liu, J.G., Lin, J.H., Guo, Q., Zhou, T.: Locating influential nodes via dynamics-sensitive centrality. Sci. Rep. 6(1), 1\u20138 (2016)","journal-title":"Sci. Rep."},{"issue":"1","key":"23_CR18","first-page":"1","volume":"5","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Tang, M., Zhou, T., Do, Y.: Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Sci. Rep. 5(1), 1\u20138 (2015)","journal-title":"Sci. Rep."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2014.05.003","volume":"46","author":"C Long","year":"2014","unstructured":"Long, C., Wong, R.C.W.: Viral marketing for dedicated customers. Inf. Syst. 46, 1\u201323 (2014)","journal-title":"Inf. Syst."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Chen, D., Ren, X.L., Zhang, Q.M., Zhang, Y.C., Zhou, T.: Vital nodes identification in complex networks. Phys. Rep. 650, 1\u201363 (2016)","journal-title":"Phys. Rep."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Marner, M.R., Smith, R.T., Thomas, B.H., Klein, K., Eades, P., Hong, S.H.: Gion: interactively untangling large graphs on wall-sized displays. In: GD 2014, pp. 113\u2013124 (2014)","DOI":"10.1007\/978-3-662-45803-7_10"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: SIGKDD 2002, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"23_CR23","series-title":"SpringerBriefs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23105-1","volume-title":"Diffusion in Social Networks","author":"P Shakarian","year":"2015","unstructured":"Shakarian, P., Bhatnagar, A., Aleali, A., Shaabani, E., Guo, R.: Diffusion in Social Networks. SCS, Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23105-1"},{"issue":"6","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913\u20131926 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR25","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Teng, S.H.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981\u20131025 (2011)","journal-title":"SIAM J. Comput."},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD 2015, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K., et\u00a0al.: Social network analysis: methods and applications (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"T Zhu","year":"2014","unstructured":"Zhu, T., Wang, B., Wu, B., Zhu, C.: Maximizing the spread of influence ranking in social networks. Inf. Sci. 278, 535\u2013544 (2014)","journal-title":"Inf. Sci."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53499-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T20:08:08Z","timestamp":1709150888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53499-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534980","9783031534997"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53499-7_23","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Menton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}