On the algorithmic complexity of edge total domination (Q300244)
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 6598552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the algorithmic complexity of edge total domination |
scientific article; zbMATH DE number 6598552 |
Statements
On the algorithmic complexity of edge total domination (English)
0 references
27 June 2016
0 references
edge total domination
0 references
algorithm
0 references
NP-completeness
0 references
undirected path graphs
0 references
0 references
0.9046497344970704
0 references
0.8641248941421509
0 references
0.8630164265632629
0 references
0.8444221019744873
0 references
0.8412474393844604
0 references
