Haiko Müller, Andreas Brandstädt. The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. Theoretical Computer Science, 53:257-265, 1987.
@article{MullerB87,
title = {The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs},
author = {Haiko Müller and Andreas Brandstädt},
year = {1987},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MullerB87},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {53},
pages = {257-265},
}