Randomized algorithms and upper bounds for multiple domination in graphs and networks (Q1941386)
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 algorithms and upper bounds for multiple domination in graphs and networks |
scientific article; zbMATH DE number 6143695
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized algorithms and upper bounds for multiple domination in graphs and networks |
scientific article; zbMATH DE number 6143695 |
Statements
Randomized algorithms and upper bounds for multiple domination in graphs and networks (English)
0 references
12 March 2013
0 references
randomized algorithm
0 references
\(k\)-domination
0 references
\(k\)-tuple domination
0 references
\(\alpha \)-domination
0 references
\(\alpha \)-rate domination
0 references
