we consider a dynamic domination problem for graphs in which an infinitesequence of attacks occur at vertices with guards and the guard at theattacked vertex is required to vacate the vertex by moving to a neighboringvertex with no guard. other guards are allowed to move at the same time, andbefore and after each attack and the resulting guard movements, the verticescontaining guards form a dom...

During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...

We study the interplay between the diffusion of a harmful state in a network of contacts and the possibility of individual agents to undertake costly investment to protect themselves against infection. We characterize how equilibrium diffusion outcomes, such as immunization rate and total prevalence, respond to changes in the architecture of the network, and show that these responses depend on ...

Models of protection in computer systems usually possess two components: a finite, labeled, directed two color graph representing the protection state of an operating system and a finite set of graph transformation rules with which the protection state may be changed. Harrison et al. demonstrated [ 1 ] that the safety problem for a very general protection model is undecidable; i.e., no algorith...