Vertex Domination in Dynamic Networks.

This paper studies a vertex domination problem in dynamic networks, which allows dynamic change of the set of vertices, the set of edges, and the set of weights. In particular, we will examine the following two theoretical issues arising in designing an adaptive vertex domination scheme for such networks: 1) How can we transfer a given configuration to a dominating configuration while keeping that any intermediate configuration is safe? 2) How can we reduce the computational complexity of the vertex domination problem by allowing defections in the domination? [ABSTRACT FROM AUTHOR]