Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity

DOI10.1080/15427951.2015.1018019zbMath1465.91024OpenAlexW2053926665MaRDI QIDQ4985807

Assane Gueye, Aron Laszka

Publication date: 26 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2015.1018019

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• Laplacians and the Cheeger inequality for directed graphs
• Toughness in graphs -- a survey
• Game-theoretic Robustness of Many-to-one Networks
• Design of Network Topology in an Adversarial Environment
• Quantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity
• Optimal attack and reinforcement of a network
• Robustness and Vulnerability of Scale-Free Random Graphs
• Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality
• A Game-Theoretic Framework for Network Security Vulnerability Assessment and Mitigation
• Vulnerability of weighted networks
• Collective dynamics of ‘small-world’ networks
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity