{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:51:25Z","timestamp":1775065885336,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s40747-025-01922-9","type":"journal-article","created":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T08:41:15Z","timestamp":1747644075000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Utilizing weak graph for edge consolidation-based efficient enhancement of network robustness"],"prefix":"10.1007","volume":"11","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[]},{"given":"Zhengdan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,19]]},"reference":[{"issue":"1","key":"1922_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1038\/s42254-023-00676-y","volume":"6","author":"O Artime","year":"2024","unstructured":"Artime O, Grassia M, De Domenico M, Gleeson JP, Makse HA, Mangioni G, Perc M, Radicchi F (2024) Robustness and resilience of complex networks. Nat Rev Phys 6(1):114\u2013131","journal-title":"Nat Rev Phys"},{"issue":"6","key":"1922_CR2","first-page":"5915","volume":"35","author":"S Freitas","year":"2023","unstructured":"Freitas S, Yang D, Kumar S, Tong H, Chau DH (2023) Graph vulnerability and robustness: a survey. IEEE Trans Knowl Data Eng 35(6):5915\u20135934","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1922_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2022.103540","volume":"209","author":"MK Hasan","year":"2023","unstructured":"Hasan MK, Habib AA, Shukur Z, Ibrahim F, Islam S, Razzaque MA (2023) Review on cyber-physical and cyber-security system in smart grid: standards, protocols, constraints, and recommendations. J Netw Comput Appl 209(1):103540","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"1922_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2024.103832","volume":"224","author":"S Murtuza","year":"2024","unstructured":"Murtuza S, Asawa K (2024) Early prevention and mitigation of link flooding attacks in software defined networks. J Netw Comput Appl 224(1):103832","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"1922_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107313","volume":"207","author":"S Wang","year":"2021","unstructured":"Wang S, Lv W, Zhang J, Luan S, Chen C, Gu X (2021) Method of power network critical nodes identification and robustness enhancement based on a cooperative framework. Reliab Eng Syst Saf 207(1):107313","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"1922_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.physa.2017.02.054","volume":"478","author":"C Hong","year":"2017","unstructured":"Hong C, He N, Lordan O, Liang BY, Yin NY (2017) Efficient calculation of the robustness measure r for complex networks. Phys A 478(1):63\u201368","journal-title":"Phys A"},{"issue":"4","key":"1922_CR7","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1109\/TNSE.2021.3110195","volume":"8","author":"T Zhao","year":"2021","unstructured":"Zhao T, Si W, Li W, Zomaya AY (2021) Towards minimizing the $$r$$ metric for measuring network robustness. IEEE Trans Netw Sci Eng 8(4):3290\u20133302","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1922_CR8","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1109\/TNSE.2022.3150289","volume":"9","author":"W Si","year":"2022","unstructured":"Si W, Mburano B, Zheng WX, Qiu T (2022) Measuring network robustness by average network flow. IEEE Trans Network Sci Eng 9:1697\u20131712","journal-title":"IEEE Trans Network Sci Eng"},{"issue":"1","key":"1922_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2021.107526","volume":"210","author":"D Fan","year":"2021","unstructured":"Fan D, Lin J, Cai B, Liu B (2021) Robustness of maintenance support service networks: attributes, evaluation and improvement. Reliab Eng Syst Saf 210(1):107526","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"1922_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2024.109969","volume":"245","author":"X Wei","year":"2024","unstructured":"Wei X, Wang M, Meng Q (2024) Vulnerability assessment and reduction for intermodal freight transportation networks. Reliab Eng Syst Saf 245(1):109969","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"1922_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.epsr.2023.109138","volume":"217","author":"S Wang","year":"2023","unstructured":"Wang S, Dong Q, Zhang J, Sun J, Gu X, Chen C (2023) Robustness assessment of power network with renewable energy. Electr Power Syst Res 217(1):109138","journal-title":"Electr Power Syst Res"},{"issue":"3","key":"1922_CR12","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1109\/TNET.2019.2907243","volume":"27","author":"T Qiu","year":"2019","unstructured":"Qiu T, Liu J, Si W, Wu DO (2019) Robustness optimization scheme with multi-population co-evolution for scale-free wireless sensor networks. IEEE\/ACM Trans Netw 27(3):1028\u20131042","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"5","key":"1922_CR13","first-page":"2523","volume":"69","author":"W Ma","year":"2022","unstructured":"Ma W, Fang J, Wu J (2022) Analyzing robustness of complex networks against incomplete information. IEEE Trans Circuits Syst II Express Briefs 69(5):2523\u20132527","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"1922_CR14","doi-asserted-by":"crossref","unstructured":"Tu H, Gu F, Zhang X, Xia Y (2023) Robustness analysis of power system under sequential attacks with incomplete information. Reliab Eng Syst Saf 232(1):109048","DOI":"10.1016\/j.ress.2022.109048"},{"issue":"1","key":"1922_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymssp.2024.112063","volume":"224","author":"X Shao","year":"2025","unstructured":"Shao X, Cai B, Zou Z, Shao H, Yang C, Liu Y (2025) Artificial intelligence enhanced fault prediction with industrial incomplete information. Mech Syst Signal Process 224(1):112063","journal-title":"Mech Syst Signal Process"},{"issue":"12","key":"1922_CR16","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/LCOMM.2019.2941940","volume":"23","author":"Y Lu","year":"2019","unstructured":"Lu Y, Zhao Y, Sun F, Liang R (2019) Measuring and improving communication robustness of networks. IEEE Commun Lett 23(12):2168\u20132171","journal-title":"IEEE Commun Lett"},{"issue":"1","key":"1922_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.128442","volume":"611","author":"S Ma","year":"2023","unstructured":"Ma S, Shen B, Ma J, Hu W, Peng T (2023) Improvement of network robustness against cascading failures based on the min\u2013max edge-adding strategy. Phys A 611(1):128442","journal-title":"Phys A"},{"issue":"1","key":"1922_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2024.114470","volume":"179","author":"W Wei","year":"2024","unstructured":"Wei W, Sun G, Zhang Q (2024) Large-scale robustness-oriented efficient edge addition through traversal tree-based weak edge identification. Chaos, Solitons and Fractals 179(1):114470","journal-title":"Chaos, Solitons and Fractals"},{"issue":"3","key":"1922_CR19","doi-asserted-by":"publisher","first-page":"2287","DOI":"10.1007\/s11071-020-05607-5","volume":"100","author":"Z Dong","year":"2020","unstructured":"Dong Z, Tian M, Tang R, Li X, Lai J (2020) Improving the robustness of spatial networks by link addition: more and dispersed links perform better. Nonlinear Dyn 100(3):2287\u20132298","journal-title":"Nonlinear Dyn"},{"issue":"1","key":"1922_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2023.109893","volume":"244","author":"J Li","year":"2024","unstructured":"Li J, Qi X, He Y, Liu L (2024) Sdn candidate and protection path selection for link failure protection in hybrid sdns. Reliab Eng Syst Saf 244(1):109893","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"1922_CR21","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.neucom.2021.10.031","volume":"468","author":"S Munikoti","year":"2022","unstructured":"Munikoti S, Das L, Natarajan B (2022) Scalable graph neural network-based framework for identifying critical nodes and links in complex networks. Neurocomputing 468(1):211\u2013221","journal-title":"Neurocomputing"},{"issue":"4","key":"1922_CR22","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1109\/TNET.2017.2689019","volume":"25","author":"J Zhang","year":"2017","unstructured":"Zhang J, Modiano E, Hay D (2017) Enhancing network robustness via shielding. IEEE\/ACM Trans Netw 25(4):2209\u20132222","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1922_CR23","doi-asserted-by":"crossref","unstructured":"Tao B, Xiao M, Khoussainov B, Peng J (2022) Optimal shielding to guarantee region-based connectivity under geographical failures. In: Proceedings of IEEE conference on computer communications, pp 1109\u2013 1118","DOI":"10.1109\/INFOCOM48880.2022.9796753"},{"issue":"1","key":"1922_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2022.108800","volume":"228","author":"M Liu","year":"2022","unstructured":"Liu M, Qi X, Pan H (2022) Optimizing communication network geodiversity for disaster resilience through shielding approach. Reliab Eng Syst Saf 228(1):108800","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"1922_CR25","first-page":"1","volume":"1","author":"Q Bai","year":"2024","unstructured":"Bai Q, Ni L, Zhang Y, Yao W (2024) Monte Carlo safeguarding of key links through multiple random walks in large network. Math Methods Appl Sci 1(1):1\u201317","journal-title":"Math Methods Appl Sci"},{"issue":"1","key":"1922_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2022.109082","volume":"232","author":"W Wei","year":"2023","unstructured":"Wei W, Liu Y, Yang W (2023) Ptum: efficient shielding of large-scale network through pruned tree-cut mapping. Reliab Eng Syst Saf 232(1):109082","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"1922_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113400","volume":"170","author":"W Wei","year":"2023","unstructured":"Wei W, Wang P, Zhang Q (2023) Optimal pruned tree-cut mapping-based fast shielding for large-scale networks. Chaos, Solitons and Fractals 170(1):113400","journal-title":"Chaos, Solitons and Fractals"},{"key":"1922_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"A Bondy","year":"2008","unstructured":"Bondy A, Murty U (2008) Graph theory. Springer, Berlin"},{"key":"1922_CR29","unstructured":"The source code of algorithm. [Online]. Available: https:\/\/github.com\/wdi2024\/network_protection\/"},{"key":"1922_CR30","unstructured":"CPLEX home page [Online]. Available: https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01922-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01922-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01922-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T11:07:24Z","timestamp":1750331244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01922-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1922"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01922-9","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,19]]},"assertion":[{"value":"31 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}}],"article-number":"298"}}