论文信息 - Paired domination on interval and circular-arc graphs

Paired domination on interval and circular-arc graphs

We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m+n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+n)) time.

T. C. Edwin Cheng | C. T. Ng | Liying Kang

[1] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .

[2] Ding-Zhu Du,et al. Paired-domination of Trees , 2003, J. Glob. Optim..

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

[4] Peter J. Slater,et al. Paired-domination in graphs , 1998, Networks.

[5] Jeremy P. Spinrad,et al. An O(n2 algorithm for circular-arc graph recognition , 1993, SODA '93.

[6] Maw-Shang Chang,et al. Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs , 1992, SIAM J. Comput..

[7] Martin Charles Golumbic. Interval graphs and related topics , 1985, Discret. Math..

[8] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[9] Maurizio A. BONUCCELLI. Dominating sets and domatic number of circular arc graphs , 1985, Discret. Appl. Math..

[10] C. Pandu Rangan,et al. Total Domination in Interval Graphs Revisited , 1988, Inf. Process. Lett..