The Complexity of Domination Problems in Circle Graphs

Abstract Circle graphs are the intersection graphs of chords of a circle. In this paper we show that the problems of finding a minimum dominating set, a minimum connected dominating set and a minimum total dominating set are NP-complete for circle graphs. We also present a polynomial time algorithm for finding a minimum cardinality dominating clique in a circle graph.

[1]  Wolfgang Maass.  On the Complexity of Nonconvex Covering , 1986, SIAM J. Comput..

[2]  Dieter Kratsch,et al.  On the restriction of some NP-complete graph problems to permutation graphs , 1985, FCT.

[3]  Dieter Kratsch,et al.  Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..

[4]  Martin Farber,et al.  Independent domination in chordal graphs , 1982, Oper. Res. Lett..

[5]  Dieter Kratsch,et al.  On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[6]  S. M. Hedetniemi,et al.  On the Algorithmic Complexity of Total Domination , 1984 .

[7]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[8]  Kellogg S. Booth,et al.  Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[9]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  D. Corneil,et al.  A dynamic programming approach to the dominating set problem on k trees , 1987 .

[12]  Yehoshua Perl,et al.  Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..

[13]  Martin Farber,et al.  Domination in Permutation Graphs , 1985, J. Algorithms.

[14]  Lorna Stewart,et al.  Dominating sets in perfect graphs , 1991, Discret. Math..

[15]  Wen-Lian Hsu,et al.  Recognizing circle graphs in polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[16]  Mikhail J. Atallah,et al.  Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..

[17]  Charles J. Colbourn,et al.  Permutation graphs: Connected domination and Steiner trees , 1991, Discret. Math..