Algorithmic aspects of secure connected domination in graphs (Q2042631)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic aspects of secure connected domination in graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspects of secure connected domination in graphs |
scientific article |
Statements
Algorithmic aspects of secure connected domination in graphs (English)
0 references
21 July 2021
0 references
secure domination
0 references
complexity classes
0 references
tree-width
0 references
chordal graphs
0 references
