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

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.

Abstract

Abstract is missing.