21 citations · 51 across the 5 of their papers we have counts for
6 papers
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…
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 …
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…
Parallel Algorithm and Dynamic Exponent for Diffusion-limited Aggregation
K. Moriarty, J. Machta, R. Greenlaw
A parallel algorithm for ``diffusion-limited aggregation'' (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm…
The Computational Complexity of Generating Random Fractals
J. Machta, R. Greenlaw
In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of paralle…
The Parallel Complexity of Growth Models
J. Machta, R. Greenlaw
This paper investigates the parallel complexity of several non-equilibrium growth models. Invasion percolation, Eden growth, ballistic deposition and solid-on-solid growth are all…