Double vertex-edge domination in graphs: complexity and algorithms (Q2053214)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Double vertex-edge domination in graphs: complexity and algorithms |
scientific article; zbMATH DE number 7435213
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Double vertex-edge domination in graphs: complexity and algorithms |
scientific article; zbMATH DE number 7435213 |
Statements
Double vertex-edge domination in graphs: complexity and algorithms (English)
0 references
29 November 2021
0 references
domination
0 references
vertex-edge domination
0 references
double vertex-edge domination
0 references
polynomial time algorithm
0 references
NP-complete
0 references
0 references
0.9884067
0 references
0.9318675
0 references
0 references
0 references
0 references
0 references
