On computing a minimum secure dominating set in block graphs (Q1702842): 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-017-0197-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2767964623 / rank | |||
Normal rank | |||
Revision as of 01:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing a minimum secure dominating set in block graphs |
scientific article |
Statements
On computing a minimum secure dominating set in block graphs (English)
0 references
1 March 2018
0 references
domination
0 references
secure domination
0 references
block graphs
0 references
linear time algorithm
0 references
NP-completeness
0 references
