The secure domination problem in cographs (Q1730021): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2019.01.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2019.01.005 / rank | |||
Normal rank | |||
Latest revision as of 06:20, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The secure domination problem in cographs |
scientific article |
Statements
The secure domination problem in cographs (English)
0 references
11 March 2019
0 references
domination
0 references
secure domination
0 references
cographs
0 references
polynomial-time algorithm
0 references
graph algorithms
0 references
