Abstract
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 problem involving points in the plane, and we describe a sweeping algorithm for this problem; if the permutation over the set N n = {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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atallah, M.J., Manacher, G.K., Urrutia, J.: Finding a minimum independent dominating set in a permutation graph. Discrete Appl. Math. 21, 177–183 (1988)
Brandstadt, A., Kratsch, D.: On domination problems for permutation and other graphs. Theoret. Comput. Sci. 54, 181–198 (1987)
Brešar, B., Henning, M.A., Rall, D.F.: Paired-domination of Cartesian products of graphs and rainbow domination. Electr. Notes in Discrete Math. 22, 233–237 (2005)
Chao, H.S., Hsu, F.R., Lee, R.C.T.: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Appl. Math. 102, 159–173 (2000)
Cheng, T.C.E., Kang, L.Y., Ng, C.T.: Paired domination on interval and circular-arc graphs. Discrete Appl. Math. 155, 2077–2086 (2007)
Cheng, T.C.E., Kang, L., Shan, E.: A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discrete Appl. Math. 157, 262–271 (2009)
Dorbec, P., Gravier, S., Henning, M.A.: Paired-domination in generalized claw-free graphs. J. Comb. Optim. 14, 1–7 (2007)
Farber, M., Keil, J.M.: Domination in permutation graphs. J. Algorithms 6, 309–321 (1985)
Favaron, O., Henning, M.A.: Paired-domination in claw-free cubic graphs. Graphs and Combinatorics 20, 447–456 (2004)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., New York (1980)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)
Haynes, T.W., Slater, P.J.: Paired-domination in graphs. Networks 32, 199–206 (1998)
Hedetniemi, S.T., Laskar, R. (eds.): Topics on Domination. Ann. Discrete Math., vol. 48. North-Holland, Amsterdam (1991)
Helmbold, D., Mayr, E.W.: Applications of parallel algorithms to families of perfect graphs. Computing 7, 93–107 (1990)
Henning, M.A., Plummer, M.D.: Vertices contained in all or in no minimum paired-dominating set of a tree. J. Comb. Optim. 10, 283–294 (2005)
Kang, L., Sohn, M.Y., Cheng, T.C.E.: Paired-domination in inflated graphs. Theor. Comput. Sci. 320, 485–494 (2004)
Lu, C.L., Ko, M.-T., Tang, C.Y.: Perfect edge domination and efficient edge domination in graphs. Discrete Appl. Math. 119, 227–250 (2002)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201, 189–241 (1999)
Nikolopoulos, S.D.: Coloring permutation graphs in parallel. Discrete Appl. Math. 120, 165–195 (2002)
Nikolopoulos, S.D., Papadopoulos, C.: On the performance of the First-Fit coloring algorithm on permutation graphs. Inform. Process. Lett. 75, 265–273 (2000)
Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canadian J. Math. 23, 160–175 (1971)
Qiao, H., Kang, L., Gardei, M., Du, D.-Z.: Paired-domination of trees. J. of Global Optimization 25, 43–54 (2003)
Reif, J. (ed.): Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, Inc., San Mateo (1993)
Rhee, C., Liang, Y.D., Dhall, S.K., Lakshmivarahan, S.: An O(n + m)-time algorithm for finding a minimum-weight dominating set in a permutation graph. SIAM J. Comput. 25, 404–419 (1996)
Spinrad, J.: On comparability and permutation graphs. SIAM J. Comput. 14, 658–670 (1985)
Srinivasan, A., Madhukar, K., Nagavamsi, P., Rangan, C.P., Chang, M.-S.: Edge domination on bipartite permutation graphs and cotriangulated graphs. Inform. Process. Lett. 56, 165–171 (1995)
Supowit, K.J.: Decomposing a set of points into chains, with applications to permutation and circle graphs. Inform. Process. Lett. 21, 249–252 (1985)
Tsai, K.H., Hsu, W.L.: Fast algorithms for the dominating set problem on permutation graphs. Algorithmica 9, 601–614 (1993)
Yannakakis, M., Gavril, F.: Edge domination sets in graphs. SIAM J. Appl. Math. 38, 364–372 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lappas, E., Nikolopoulos, S.D., Palios, L. (2009). An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)