论文信息 - Total Domination in Interval Graphs Revisited - 字舞流文

Total Domination in Interval Graphs Revisited

Revision de l'algorithme propose par Keil pour l'ensemble dominant total de cardinalite minima dans les graphes d'intervalles

C. Pandu Rangan | G. Ramalingam

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

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

[3] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

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

[5] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

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