A greedy algorithm for the connected positive influence dominating set in \(k\)-regular graphs (Q2694953)
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 greedy algorithm for the connected positive influence dominating set in \(k\)-regular graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy algorithm for the connected positive influence dominating set in \(k\)-regular graphs |
scientific article |
Statements
A greedy algorithm for the connected positive influence dominating set in \(k\)-regular graphs (English)
0 references
5 April 2023
0 references
connected positive influence dominating set
0 references
greedy algorithm
0 references
potential function
0 references
0.8971809148788452
0 references
0.7925406694412231
0 references