We deal in this work with the following graph construction problem that arises in a model of neural computation introduced by L.G. Valiant. For an undirected graph G = (I'. E). let set N\*(X, Y ), where X, Y 2 V, denote the set of vertices other than those of X. Y which are adjacent to at least one
A graph-theoretical model of computer security
✍ Scribed by Mark Burgess; Geoffrey Canright; Kenth Engø-Monsen
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- English
- Weight
- 624 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1615-5262
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The metabolic pathways of medazepam, oxazepam, and diazepam were modeled using graph-theoretic transforms which are incorporable into computer-assisted metabolic analysis programs. The information, represented in the form of a graph-theoretic transform kit, which was obtained from these pathways was
In this paper a time-discrete dynamic model for the process of disarmament is investigated. The state variables of the system are costs and security values. We assume that the costs can be controlled, and we aim at reducing the costs to zero and achieving non-negative security values after a finite