Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width |
scientific article |
Statements
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (English)
0 references
12 March 2020
0 references
semitotal dominating set
0 references
total dominating set
0 references
computational complexity
0 references
bounded mim-width
0 references
dually chordal graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
