论文信息 - A Unified Approach to Domination Problems on Interval Graphs - 字舞流文

A Unified Approach to Domination Problems on Interval Graphs

C. P. Rangan | G. Ramalingam | C. Rangan

[1] Alan A. Bertossi,et al. Total Domination in Interval Graphs , 1986, Inf. Process. Lett..

[2] J. Mark Keil,et al. Total Domination in Interval Graphs , 1986, Inf. Process. Lett..

[3] Martin Farber,et al. Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.

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

[5] Martin Farber,et al. Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

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

[7] 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..