Algorithmic aspects of 2-secure domination in graphs (Q2045038): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-021-00739-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3155641883 / rank | |||
Normal rank | |||
Revision as of 02:34, 20 March 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
