Time complexity of the edge replacement problem in a cyber security system
© 2018 IEEE. In this article, we propose a new defensive problem in a security system. Let S(T, c, p) be a security system, where T = (V, E) is a rooted tree rooted at r, c and p are assignment functions c: E(T) → + and p: V(T) {r} → +, respectively. Additionally, let T[v] be a rooted subtree rooted...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Conference Proceeding |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85066496357&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65507 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |