The secure domination problem in cographs (Q1730021): 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.1016/j.ipl.2019.01.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2910118765 / rank | |||
Normal rank | |||
Revision as of 02:42, 20 March 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
