On computing a minimum secure dominating set in block graphs (Q1702842): Difference between revisions
From MaRDI portal
Latest revision as of 04:55, 11 December 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