An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
type: Item
instance of: scholarly article
title: An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
zbMATH Open document ID: 1227.05205
author: Colin Cooper
author: Michele Zito
published in: Discrete Applied Mathematics
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5569434
zbMATH Keywords: random trees
zbMATH Keywords: algorithms
zbMATH Keywords: dominating sets
MaRDI profile type: Publication
full work available at URL: j.dam.2008.06.024
OpenAlex ID: W2087753151
cites work: Emergence of Scaling in Random Networks
cites work: Q3682518
cites work: A linear algorithm for the domination number of a tree
cites work: Sparse hypercube 3-spanners
cites work: A threshold of ln n for approximating set cover
cites work: `` Strong '' NP-Completeness Results
cites work: Q4368729
cites work: Q4368728
cites work: Q3496342
cites work: Q4940321
cites work: On the domination number of a random graph
cites work: Q4796200
DOI: 10.1016/J.DAM.2008.06.024
description: scientific article; zbMATH DE number 5569434