A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266)
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: A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph |
scientific article |
Statements
A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (English)
0 references
24 August 2022
0 references
piercing circular arcs problem
0 references
\(k\)-hop dominating set problem
0 references
0 references
0 references
