论文信息 - Total Domination in Interval Graphs

Total Domination in Interval Graphs

Abstract A total dominating set of a graph G is a subset S of nodes such that each node of G is adjacent to some node of S. We present an O(n 2 ) time algorithm for finding a minimum cardinality total dominating set in an interval graph (one which represents intersecting intervals on the line) by reducing it to a shortest path problem on an appropriate acyclic directed network.

Alan A. Bertossi | A. Bertossi

[1] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[2] Stephen T. Hedetniemi,et al. Total domination in graphs , 1980, Networks.

[3] G. Nemhauser,et al. The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs , 1984 .

[4] Alan A. Bertossi,et al. Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..

[5] F. Roberts. Graph Theory and Its Applications to Problems of Society , 1987 .

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

[7] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

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