Randomized greedy algorithms for finding smallk-dominating sets of regular graphs (Q5704842)
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: Randomized greedy algorithms for finding smallk-dominating sets of regular graphs |
scientific article; zbMATH DE number 2229430
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized greedy algorithms for finding smallk-dominating sets of regular graphs |
scientific article; zbMATH DE number 2229430 |
Statements
Randomized greedy algorithms for finding smallk-dominating sets of regular graphs (English)
0 references
15 November 2005
0 references
random regular graph
0 references
differential equations method
0 references
