Quantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity

DOI10.1007/978-3-319-02786-9_10zbMath1423.68054OpenAlexW2270253310MaRDI QIDQ3190042

Assane Gueye, Aron Laszka

Publication date: 15 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-02786-9_10

zbMATH Keywords

computational complexitygame theoryblocking gamesnetwork topology robustnessrobustness metrics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Applications of game theory (91A80)

Related Items (2)

Spanning tree modulus for secure broadcast games ⋮ Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity

This page was built for publication: Quantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity