The following pages link to Connected subgraph defense games (Q5925537):
Displaying 11 items.
- Security games on matroids (Q507326) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- A network game with attackers and a defender (Q930603) (← links)
- A novel dynamic method in distributed network attack-defense game (Q1665444) (← links)
- Rolling horizon games of resilient networks with non-uniform horizons (Q2095345) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes (Q2208245) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- The price of defense (Q2663706) (← links)
- On cyber attacks and the maximum-weight rooted-subtree problem (Q2820783) (← links)
