论文信息 - The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs - 字舞流文

The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs

We show that the problems steiner tree, dominating set and connected dominating set are NP-complete for chordal bipartite graphs.

Andreas Brandstädt | Haiko Müller | A. Brandstädt | H. Müller

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

[2] Jeremy P. Spinrad,et al. Bipartite permutation graphs , 1987, Discret. Appl. Math..

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

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

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

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

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