Algorithmic aspects of semitotal domination in graphs (Q1731849)
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 7036301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of semitotal domination in graphs |
scientific article; zbMATH DE number 7036301 |
Statements
Algorithmic aspects of semitotal domination in graphs (English)
0 references
14 March 2019
0 references
domination
0 references
semitotal domination
0 references
bipartite graphs
0 references
chordal graphs
0 references
interval graphs
0 references
graph algorithm
0 references
NP-complete
0 references
approximation algorithm
0 references
APX-complete
0 references
0 references
0.9082549214363098
0 references
0.9020849466323853
0 references
0.8878841996192932
0 references
0.8861761093139648
0 references
0.8838645815849304
0 references
