The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90067-3 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058460385 / rank | |||
Revision as of 08:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs |
scientific article |
Statements
The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (English)
0 references
1987
0 references
The authors show that several known NP-complete problems (for general graphs) remain NP-complete even when restricted to chordal bipartite graphs. The problems in question are Steiner tree, dominating set and connected dominating set.
0 references
NP-completeness
0 references
chordal bipartite graphs
0 references
Steiner tree
0 references
dominating set
0 references
