3 papers
cs.DM2016
The structure and topology of rooted weighted trees modeling layered cyber-security systems
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
In this paper we consider a layered-security model in which the containers and their nestings are given in the form of a rooted tree . A {\em cyber-security model\/} is an order…
cs.DS2015
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
In our cyber security model we define the concept of {\em penetration cost}, which is the cost that must be paid in order to break into the next layer of security. Given a tree …
math.CO2008
The Complexity of the Evolution of Graph Labelings
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
We study the {\sc Graph Relabeling Problem}--given an undirected, connected, simple graph , two labelings and of , and label {\em flip} or {\em mutation} fun…