The structure of rooted weighted trees modeling layered cyber-security systems
In this paper we consider the structure and topology of a layered-security model in which the containers and their nestings are given in the form of a rooted tree T. A cyber-security model is an ordered three-tuple M = (T;C; P) where C and P are multisets of penetration costs for the containers and...
Saved in:
Main Authors: | Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018819781&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55611 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
by: Geir Agnarsson, et al.
Published: (2018) -
On cyber attacks and the maximum-weight rooted-subtree problem
by: Geir Agnarsson, et al.
Published: (2018) -
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
by: Geir Agnarsson, et al.
Published: (2018) -
The structure of rooted weighted trees modeling layered cyber-security systems
by: Agnarsson G., et al.
Published: (2017) -
On cyber attacks and the maximum-weight rooted-subtree problem
by: Agnarsson G., et al.
Published: (2017)