{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:23:35Z","timestamp":1775096615150,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"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":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06239-x","type":"journal-article","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T17:38:51Z","timestamp":1716917931000},"page":"19796-19823","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Assessing edge importance in social networks: an importance indicator based on the $$k$$-sup structure"],"prefix":"10.1007","volume":"80","author":[{"given":"Mengyao","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yanhui","family":"Zhai","sequence":"additional","affiliation":[]},{"given":"Deyu","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,28]]},"reference":[{"key":"6239_CR1","doi-asserted-by":"publisher","first-page":"101738","DOI":"10.1016\/j.jocs.2022.101738","volume":"62","author":"O Ugurlu","year":"2022","unstructured":"Ugurlu O (2022) Comparative analysis of centrality measures for identifying critical nodes in complex networks. J Comput Sci 62:101738. https:\/\/doi.org\/10.1016\/j.jocs.2022.101738","journal-title":"J Comput Sci"},{"issue":"3","key":"6239_CR2","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s11280-022-01049-8","volume":"25","author":"R Sun","year":"2022","unstructured":"Sun R, Chen C, Liu X, Xu S, Wang X, Lin X (2022) Critical nodes identification in large networks: the inclined and detached models. World Wide Web 25(3):1315\u20131341. https:\/\/doi.org\/10.1007\/s11280-022-01049-8","journal-title":"World Wide Web"},{"issue":"2","key":"6239_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/TCSS.2022.3217071","volume":"10","author":"S Yu","year":"2023","unstructured":"Yu S, Wang Y, Li J, Fang X, Chen J, Zheng Z, Fu C (2023) An improved differential evolution framework using network topology information for critical nodes detection. IEEE Trans Comput Social Syst 10(2):448\u2013457. https:\/\/doi.org\/10.1109\/TCSS.2022.3217071","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"4","key":"6239_CR4","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Social Netw 28(4):466\u2013484. https:\/\/doi.org\/10.1016\/j.socnet.2005.11.005","journal-title":"Social Netw"},{"issue":"11","key":"6239_CR5","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893. https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nat Phys"},{"issue":"3","key":"6239_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Social Netw 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Social Netw"},{"issue":"2","key":"6239_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Social Netw 30(2):136\u2013145. https:\/\/doi.org\/10.1016\/j.socnet.2007.11.001","journal-title":"Social Netw"},{"key":"6239_CR8","doi-asserted-by":"publisher","first-page":"110134","DOI":"10.1016\/j.asoc.2023.110134","volume":"136","author":"S Wang","year":"2023","unstructured":"Wang S, Tan X (2023) Finding robust influential seeds from networked systems against structural failures using a niching memetic algorithm. Appl Soft Comput 136:110134","journal-title":"Appl Soft Comput"},{"issue":"6612","key":"6239_CR9","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.abl4476","volume":"377","author":"K Rajkumar","year":"2022","unstructured":"Rajkumar K, Saint-Jacques G, Bojinov I, Brynjolfsson E, Aral S (2022) A causal test of the strength of weak ties. Science 377(6612):1304\u20131310","journal-title":"Science"},{"key":"6239_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1146\/annurev-soc-030921-034152","volume":"49","author":"M Kim","year":"2023","unstructured":"Kim M, Fernandez RM (2023) What makes weak ties strong? Ann Rev Sociol 49:177\u2013193. https:\/\/doi.org\/10.1146\/annurev-soc-030921-034152","journal-title":"Ann Rev Sociol"},{"issue":"6612","key":"6239_CR11","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1126\/science.add0692","volume":"377","author":"D Wang","year":"2022","unstructured":"Wang D, Uzzi B (2022) Weak ties, failed tries, and success. Science 377(6612):1256\u20131258","journal-title":"Science"},{"issue":"7989","key":"6239_CR12","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1038\/s41586-023-06767-1","volume":"623","author":"Y Lin","year":"2023","unstructured":"Lin Y, Frey CB, Wu L (2023) Remote collaboration fuses fewer breakthrough ideas. Nature 623(7989):987\u2013991","journal-title":"Nature"},{"issue":"12","key":"6239_CR13","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.0610245104","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.0610245104","journal-title":"Proc Natl Acad Sci"},{"issue":"11","key":"6239_CR14","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat A, Barth\u00e9lemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci 101(11):3747\u20133752. https:\/\/doi.org\/10.1073\/pnas.0400087101","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"6239_CR15","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TKDE.2018.2880976","volume":"32","author":"F Zhang","year":"2020","unstructured":"Zhang F, Li C, Zhang Y, Qin L, Zhang W (2020) Finding critical users in social communities: the collapsed core and truss problems. IEEE Trans Knowl Data Eng 32(1):78\u201391. https:\/\/doi.org\/10.1109\/TKDE.2018.2880976","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"6239_CR16","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473. https:\/\/doi.org\/10.1086\/jar.33.4.3629752","journal-title":"J Anthropol Res"},{"issue":"1","key":"6239_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s13278-022-00876-x","volume":"12","author":"K Kanwar","year":"2022","unstructured":"Kanwar K, Kaushal S, Kumar H, Gupta G, Khari M (2022) Bc DCN: a new edge centrality measure to identify and rank critical edges pertaining to sir diffusion in complex networks. Soc Netw Anal Min 12(1):49","journal-title":"Soc Netw Anal Min"},{"key":"6239_CR18","doi-asserted-by":"publisher","first-page":"110677","DOI":"10.1016\/j.knosys.2023.110677","volume":"275","author":"S Wang","year":"2023","unstructured":"Wang S, Liu W (2023) Enhancing the robustness of influential seeds towards structural failures on competitive networks via a memetic algorithm. Knowl-Based Syst 275:110677. https:\/\/doi.org\/10.1016\/j.knosys.2023.110677","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"6239_CR19","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/JSYST.2018.2835642","volume":"13","author":"S Wang","year":"2019","unstructured":"Wang S, Liu J (2019) Constructing robust community structure against edge-based attacks. IEEE Syst J 13(1):582\u2013592","journal-title":"IEEE Syst J"},{"issue":"3","key":"6239_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MCI.2023.3277770","volume":"18","author":"S Wang","year":"2023","unstructured":"Wang S, Ding B, Jin Y (2023) A multi-factorial evolutionary algorithm with asynchronous optimization processes for solving the robust influence maximization problem. IEEE Comput Intell Mag 18(3):41\u201353","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"6239_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TSG.2016.2542925","volume":"9","author":"Z Li","year":"2018","unstructured":"Li Z, Shahidehpour M, Alabdulwahab A, Abusorrah A (2018) Analyzing locally coordinated cyber-physical attacks for undetectable line outages. IEEE Trans Smart Grid 9(1):35\u201347. https:\/\/doi.org\/10.1109\/TSG.2016.2542925","journal-title":"IEEE Trans Smart Grid"},{"key":"6239_CR22","doi-asserted-by":"publisher","first-page":"105780","DOI":"10.1016\/j.cnsns.2021.105780","volume":"98","author":"Y Lou","year":"2021","unstructured":"Lou Y, Wang L, Chen G (2021) A framework of hierarchical attacks to network controllability. Commun Nonlinear Sci Numer Simul 98:105780. https:\/\/doi.org\/10.1016\/j.cnsns.2021.105780","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"1","key":"6239_CR23","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/JSYST.2018.2835642","volume":"13","author":"S Wang","year":"2019","unstructured":"Wang S, Liu J (2019) Constructing robust community structure against edge-based attacks. IEEE Syst J 13(1):582\u2013592. https:\/\/doi.org\/10.1109\/JSYST.2018.2835642","journal-title":"IEEE Syst J"},{"key":"6239_CR24","doi-asserted-by":"publisher","first-page":"172398","DOI":"10.1109\/ACCESS.2020.3024942","volume":"8","author":"C Wang","year":"2020","unstructured":"Wang C, Xia Y (2020) Robustness of complex networks considering attack cost. IEEE Access 8:172398\u2013172404. https:\/\/doi.org\/10.1109\/ACCESS.2020.3024942","journal-title":"IEEE Access"},{"issue":"4","key":"6239_CR25","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1109\/TPWRD.2021.3061358","volume":"36","author":"TN Nguyen","year":"2021","unstructured":"Nguyen TN, Liu B-H, Nguyen NP, Dumba B, Chou J-T (2021) Smart grid vulnerability and defense analysis under cascading failure attacks. IEEE Trans Power Delivery 36(4):2264\u20132273. https:\/\/doi.org\/10.1109\/TPWRD.2021.3061358","journal-title":"IEEE Trans Power Delivery"},{"issue":"10","key":"6239_CR26","doi-asserted-by":"publisher","first-page":"10011","DOI":"10.1088\/1742-5468\/2010\/10\/P10011","volume":"2010","author":"X-Q Cheng","year":"2010","unstructured":"Cheng X-Q, Ren F-X, Shen H-W, Zhang Z-K, Zhou T (2010) Bridgeness: a local index on edge significance in maintaining global connectivity. J Stat Mech: Theory Exp 2010(10):10011. https:\/\/doi.org\/10.1088\/1742-5468\/2010\/10\/P10011","journal-title":"J Stat Mech: Theory Exp"},{"issue":"23","key":"6239_CR27","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci"},{"issue":"10","key":"6239_CR28","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech: Theory Exp"},{"issue":"1","key":"6239_CR29","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag VA, Waltman L, Van Eck NJ (2019) From louvain to leiden: guaranteeing well-connected communities. Sci Rep 9(1):5233. https:\/\/doi.org\/10.1038\/s41598-019-41695-z","journal-title":"Sci Rep"},{"key":"6239_CR30","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-42911-3_35","volume-title":"PRICAI 2016: trends in artificial intelligence","author":"K Saito","year":"2016","unstructured":"Saito K, Kimura M, Ohara K, Motoda H (2016) Detecting critical links in complex network to maintain information flow\/reachability. In: Booth R, Zhang M-L (eds) PRICAI 2016: trends in artificial intelligence. Springer, Cham, pp 419\u2013432. https:\/\/doi.org\/10.1007\/978-3-319-42911-3_35"},{"issue":"3","key":"6239_CR31","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0306-4573(89)90048-4","volume":"25","author":"L Hamers","year":"1989","unstructured":"Hamers L, Hemeryck Y, Herweyers G, Janssen M, Keters H, Rousseau R, Vanhoutte A (1989) Similarity measures in scientometric research: the jaccard index versus salton\u2019s cosine formula. Inf Process Manage 25(3):315\u2013318. https:\/\/doi.org\/10.1016\/0306-4573(89)90048-4","journal-title":"Inf Process Manage"},{"issue":"1","key":"6239_CR32","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10","journal-title":"Soc Netw Anal Min"},{"key":"6239_CR33","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"6239_CR34","doi-asserted-by":"publisher","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Bonet B, Koenig S (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI\u201915, pp. 4292\u20134293. AAAI Press, Austin, Texas https:\/\/doi.org\/10.5555\/2888116.2888372","DOI":"10.5555\/2888116.2888372"},{"issue":"10","key":"6239_CR35","doi-asserted-by":"publisher","first-page":"1914","DOI":"10.3390\/app8101914","volume":"8","author":"L Jiang","year":"2018","unstructured":"Jiang L, Jing Y, Hu S, Ge B, Xiao W (2018) Identifying node importance in a complex network based on node bridging feature. Appl Sci 8(10):1914. https:\/\/doi.org\/10.3390\/app8101914","journal-title":"Appl Sci"},{"issue":"1","key":"6239_CR36","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"issue":"5439","key":"6239_CR37","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"6684","key":"6239_CR38","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"6","key":"6239_CR39","doi-asserted-by":"publisher","first-page":"066130","DOI":"10.1103\/PhysRevE.85.066130","volume":"85","author":"A Zeng","year":"2012","unstructured":"Zeng A, Liu W (2012) Enhancing network robustness against malicious attacks. Phys Rev E 85(6):066130","journal-title":"Phys Rev E"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06239-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06239-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06239-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:22:45Z","timestamp":1721902965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06239-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,28]]},"references-count":39,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6239"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06239-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,28]]},"assertion":[{"value":"15 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}