On cyber attacks and the maximum-weight rooted-subtree problem
From MaRDI portal
Recommendations
- The structure of rooted weighted trees modeling layered cyber-security systems
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes
- Connected subgraph defense games
- New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees
- Connected subgraph defense games
Cited in
(9)- A bilevel programming model for proactive countermeasure selection in complex ICT systems
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Usability aware secret protection with minimum cost
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes
- Limiting adversarial budget in quantitative security assessment
- The structure of rooted weighted trees modeling layered cyber-security systems
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- On locally finite ordered rooted trees and their rooted subtrees
- Multi-points cyber defense \((1+\epsilon )\) and \((1+\epsilon )^{k-k'}\)-approximation
This page was built for publication: On cyber attacks and the maximum-weight rooted-subtree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820783)
