Algorithmic aspects of 2-secure domination in graphs (Q2045038)
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: Algorithmic aspects of 2-secure domination in graphs |
scientific article; zbMATH DE number 7380953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspects of 2-secure domination in graphs |
scientific article; zbMATH DE number 7380953 |
Statements
Algorithmic aspects of 2-secure domination in graphs (English)
0 references
11 August 2021
0 references
2-secure domination
0 references
W[2]-hard
0 references
planar graphs
0 references
APX-complete
0 references
star convex bipartite graphs
0 references
inapproximability
0 references
0 references
0.94905525
0 references
0.9398459
0 references
0 references
0.93738836
0 references
0.9367261
0 references
0.93585527
0 references
0 references
0.9312118
0 references
0.9260023
0 references
