Permanent dominating set on dynamic graphs

Abstract

We present a greedy approximation algorithm to solve the problem of finding a minimum permanent dominating set for a given dynamic graph represented using the evolving graphs model. The node set of the dynamic graph is static and only the edge set changes with time. All the change information over the lifetime of the dynamic graph is known apriori. The proposed algorithm is an O(ln(nτ))-approximation algorithm, where n is the number of nodes and τ is the lifetime of the dynamic graph.