Algorithmic aspects of 2-secure domination in graphs (Q2045038): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:26, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspects of 2-secure domination in graphs |
scientific article |
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
