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 paireddomination 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 problem involving points in the plane, and we describe a sweeping algorithm for this problem; if the permutation over the set Nn = {1, 2, . . . , 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. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Lappas, E., Nikolopoulos, S. D., & Palios, L. (2009). An O(n)-time algorithm for the paired-domination problem on permutation graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5874 LNCS, pp. 368–379). https://doi.org/10.1007/978-3-642-10217-2_36
Mendeley helps you to discover research relevant for your work.