The Complexity of the Infinity Replacement Problem in the Cyber Security Model
© 2017 IEEE. In this article we present a new defensive problem on a security system. Let M be a security model (T, C, P), where T = (V, E) is a rooted tree rooted at r, C is a multiset of E(T) costs and P is a multiset of V(T)-1 prizes and let (T, c, p) be a security system, where c and p are bijec...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Conference Proceeding |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85053450546&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62655 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |