Shortest path tree-based algorithm for efficient resilience measures

DOI10.1016/J.PHYSA.2026.131433MaRDI QIDQ7242125zbMATH OpenFDO

Authors Roy Cerqueti, Antonio Iovanella, Andrea Scozzari

Publication date 13 May 2026

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PHYSA.2026.131433

zbMATH Keywords

complex networksfinancial and infrastructural networksnetwork resilienceshock propagationshortest path tree

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites work

• A branch-and-price procedure for clustering data that are graph connected
• Clustering data that are graph connected
• Complex networks: structure and dynamics
• Exploring complex networks
• Filtering for risk assessment of interbank network
• Financial interbanking networks resilience under shocks propagation
• Optimal network compression
• Resilience of core-periphery networks in the case of rich-club
• The directed subgraph homeomorphism problem
• Two-stage robust optimization approach for enhanced community resilience under tornado hazards
• Weighted Voronoi region algorithms for political districting

This page was built for publication: Shortest path tree-based algorithm for efficient resilience measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7242125)