Random procedures for dominating sets in graphs
type: Item
instance of: scholarly article
title: Random procedures for dominating sets in graphs
zbMATH Open document ID: 1230.05222
author: Sarah Artmann
author: Frank Göring
author: Jochen Harant
author: Dieter Rautenbach
author: Ingo Schiermeyer
published in: The Electronic Journal of Combinatorics
publication date: 2010-08-12T00:00:00Z
full work available at URL: https://eudml.org/doc/228104
full work available at URL: v17i1r102.html
review text: Summary: We present and analyze some random procedures for the construction of small dominating sets in graphs. Several upper bounds for the domination number of a graph are derived from these procedures.
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5769517
zbMATH Keywords: domination
zbMATH Keywords: independence
zbMATH Keywords: probabilistic method
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5769517