Algorithm and hardness results on hop domination in graphs (Q2338219): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2019.105872 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2019.105872 / rank | |||
Normal rank | |||
Latest revision as of 02:01, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm and hardness results on hop domination in graphs |
scientific article |
Statements
Algorithm and hardness results on hop domination in graphs (English)
0 references
21 November 2019
0 references
domination
0 references
hop domination
0 references
polynomial-time algorithm
0 references
NP-completeness
0 references
graph algorithms
0 references
