Complexity issues of variants of secure domination in graphs (Q2413340): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2774310888 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4653767 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5461685 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for connected dominating sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On secure domination in graphs / rank | |||
Normal rank | |||
Latest revision as of 10:16, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity issues of variants of secure domination in graphs |
scientific article |
Statements
Complexity issues of variants of secure domination in graphs (English)
0 references
10 April 2018
0 references
secure dominating set
0 references
split graph
0 references
NP-completeness
0 references
total domination
0 references
