An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Q1026103)
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: An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm |
scientific article; zbMATH DE number 5569434
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm |
scientific article; zbMATH DE number 5569434 |
Statements
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (English)
0 references
24 June 2009
0 references
random trees
0 references
algorithms
0 references
dominating sets
0 references
