{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T11:06:45Z","timestamp":1779534405489,"version":"3.53.1"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003489","name":"Henan University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003489","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Network and Computer Applications"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.jnca.2026.104454","type":"journal-article","created":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:19:09Z","timestamp":1771658349000},"page":"104454","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Tree fringe and ridge subgraph-based critical vertex shielding for network resilience improvement"],"prefix":"10.1016","volume":"250","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wentao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuehai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chisheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinlong","family":"Duan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shewei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changwei","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jnca.2026.104454_b1","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.jnca.2026.104454_b2","author":"CPLEX home page","year":"2024"},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.physa.2017.12.142","article-title":"Enhancing robustness of interdependent network by adding connectivity and dependence links","volume":"497","author":"Cui","year":"2018","journal-title":"Phys. A"},{"key":"10.1016\/j.jnca.2026.104454_b4","doi-asserted-by":"crossref","unstructured":"Dory, M., Efron, Y., Mukhopadhyay, S., Nanongkai, D., 2021. Distributed weighted min-cut in nearly-optimal time. In: Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing. pp. 1144\u20131153.","DOI":"10.1145\/3406325.3451020"},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b5","article-title":"A modified connectivity link addition strategy to improve the resilience of multiplex networks against attacks","volume":"221","author":"Fan","year":"2022","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TKDE.2022.3163672","article-title":"Graph vulnerability and robustness: A survey","volume":"PP","author":"Freitas","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"10.1016\/j.jnca.2026.104454_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3579847","article-title":"Tolerance analysis of cyber-manufacturing systems to cascading failures","volume":"23","author":"Fu","year":"2023","journal-title":"ACM Trans. Internet Technol."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b8","article-title":"Topology optimization against cascading failures on wireless sensor networks using a memetic algorithm","volume":"177","author":"Fu","year":"2020","journal-title":"Comput. Netw."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b9","first-page":"136","article-title":"Cascading failure analysis of cyber-physical power systems considering routing strategy","volume":"70","author":"Gao","year":"2023","journal-title":"IEEE Trans. Circuits Syst. II: Express Briefs"},{"key":"10.1016\/j.jnca.2026.104454_b10","series-title":"Minimum cut in O(mlog2n) time","author":"Gawrychowski","year":"2019"},{"issue":"4","key":"10.1016\/j.jnca.2026.104454_b11","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1109\/TNSE.2023.3236482","article-title":"Robustness of interdependent power grid and communication networks to cascading failures","volume":"10","author":"Ghasemi","year":"2023","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"8","key":"10.1016\/j.jnca.2026.104454_b12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/2628036","article-title":"Efficient maximum flow algorithms","volume":"57","author":"Goldberg","year":"2014","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b13","article-title":"Cascading failure and recovery of metro-bus double-layer network considering recovery propagation","volume":"122","author":"Guo","year":"2023","journal-title":"Transp. Res. Part D: Transp. Environ."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b14","article-title":"Cascading failure in urban rail transit network considering demand variation and time delay","volume":"630","author":"Jin","year":"2023","journal-title":"Phys. A"},{"issue":"4","key":"10.1016\/j.jnca.2026.104454_b15","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/234533.234534","article-title":"A new approach to the minimum cut problem","volume":"43","author":"Karger","year":"1996","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comcom.2021.12.013","article-title":"Computationally efficient topology optimization of scale-free IoT networks","volume":"185","author":"Khan","year":"2022","journal-title":"Comput. Commun."},{"key":"10.1016\/j.jnca.2026.104454_b17","doi-asserted-by":"crossref","unstructured":"Li, J., 2021. Deterministic mincut in almost-linear time. In: Proceedings of ACM SIGACT Symposium on Theory of Computing. pp. 384\u2013395.","DOI":"10.1145\/3406325.3451114"},{"key":"10.1016\/j.jnca.2026.104454_b18","doi-asserted-by":"crossref","unstructured":"Li, J., Panigrahi, D., 2020. Deterministic min-cut in poly-logarithmic max-flows. In: Proceedings of IEEE Annual Symposium on Foundations of Computer Science. FOCS, pp. 85\u201392.","DOI":"10.1109\/FOCS46700.2020.00017"},{"issue":"2","key":"10.1016\/j.jnca.2026.104454_b19","doi-asserted-by":"crossref","first-page":"3282","DOI":"10.1109\/JSYST.2023.3248044","article-title":"Cascading failure propagation and mitigation strategies in power systems","volume":"17","author":"Li","year":"2023","journal-title":"IEEE Syst. J."},{"issue":"9","key":"10.1016\/j.jnca.2026.104454_b20","doi-asserted-by":"crossref","first-page":"2528","DOI":"10.1093\/comjnl\/bxab105","article-title":"The h-restricted connectivity of a class of hypercube-based compound networks","volume":"65","author":"Li","year":"2022","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b21","article-title":"Review of studies on the resilience of urban critical infrastructure networks","volume":"193","author":"Liu","year":"2020","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b22","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.neunet.2022.10.013","article-title":"Classification-based prediction of network connectivity robustness","volume":"157","author":"Lou","year":"2023","journal-title":"Neural Netw."},{"key":"10.1016\/j.jnca.2026.104454_b23","doi-asserted-by":"crossref","unstructured":"Saranurak, T., 2021. A simple deterministic algorithm for edge connectivity. In: Proceedings of Symposium on Simplicity in Algorithms. SOSA, pp. 80\u201385.","DOI":"10.1137\/1.9781611976496.9"},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b24","article-title":"Urban transportation networks resilience: Indicators, disturbances, and assessment methods","volume":"76","author":"Serdar","year":"2022","journal-title":"Sustain. Cities Soc."},{"issue":"3","key":"10.1016\/j.jnca.2026.104454_b25","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1109\/TNSM.2021.3091053","article-title":"Resilient and latency-aware orchestration of network slices using multi-connectivity in MEC-enabled 5G networks","volume":"18","author":"Thiruvasagam","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b26","article-title":"Improving node connectivity by optimized dual tree-based effective node consolidation","volume":"242","author":"Wei","year":"2024","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b27","article-title":"Employing the cluster of node cut sets to improve the robustness of the network measured by connectivity","volume":"254","author":"Wei","year":"2025","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"4","key":"10.1016\/j.jnca.2026.104454_b28","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/TWC.2020.3041800","article-title":"Performance, fairness, and tradeoff in UAV swarm underlaid mmwave cellular networks with directional antennas","volume":"20","author":"Yang","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"4","key":"10.1016\/j.jnca.2026.104454_b29","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1109\/TNET.2017.2689019","article-title":"Enhancing network robustness via shielding","volume":"25","author":"Zhang","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.jnca.2026.104454_b30","article-title":"Flow aggregation through dynamic routing overlaps in software defined networks","volume":"176","author":"Zhao","year":"2020","journal-title":"Comput. Netw."}],"container-title":["Journal of Network and Computer Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804526000299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804526000299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T10:59:11Z","timestamp":1779533951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1084804526000299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":30,"alternative-id":["S1084804526000299"],"URL":"https:\/\/doi.org\/10.1016\/j.jnca.2026.104454","relation":{},"ISSN":["1084-8045"],"issn-type":[{"value":"1084-8045","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tree fringe and ridge subgraph-based critical vertex shielding for network resilience improvement","name":"articletitle","label":"Article Title"},{"value":"Journal of Network and Computer Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jnca.2026.104454","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104454"}}