The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3694712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On domination problems for permutation and other graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination in permutation graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness column: an ongoing guide / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite permutation graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank | |||
Normal rank |
Latest revision as of 16:18, 18 June 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