An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

A vertex subset D of a graph G. is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardinality dominating set S of G such that the subgraph induced by S contains a perfect matching; motivation for this problem comes from the interest in finding a small number of locations to place pairs of mutually visible guards so that the entire set of guards monitors a given area. The paired-domination problem on general graphs is known to be NP-complete. In this paper, we consider the paired-domination problem on permutation graphs. We define an embedding of permutation graphs in the plane which enables us to obtain an equivalent version of the problemn involving points in the plane, and we describe a sweeping algorithm for this problem; if the permutation over the set N(n) = {1, 9,, n} defining a permutation graph G on n vertices is given, our algorithm computes a paired-dominating set of G in O(n) time, and is therefore optimal.