Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7179870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width |
scientific article; zbMATH DE number 7179870 |
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
0 references
0.8878841996192932
0 references
0.8790022134780884
0 references
0.8741183280944824
0 references
0.8711670637130737
0 references
0.8667314052581787
0 references
