The NP-completeness of steiner tree and dominating set for chordal bipartite graphs
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 53 (2-3) , 257-265
- https://doi.org/10.1016/0304-3975(87)90067-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Bipartite permutation graphsDiscrete Applied Mathematics, 1987
- Domination in permutation graphsJournal of Algorithms, 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Steiner trees, connected domination and strongly chordal graphsNetworks, 1985