Capacitated domination faster than \(O(2^n)\) (Q1944213)
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: Capacitated domination faster than \(O(2^n)\) |
scientific article; zbMATH DE number 6150500
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Capacitated domination faster than \(O(2^n)\) |
scientific article; zbMATH DE number 6150500 |
Statements
Capacitated domination faster than \(O(2^n)\) (English)
0 references
4 April 2013
0 references
graph algorithms
0 references
exponential algorithms
0 references
dominating set
0 references
capacitated domination
0 references
0 references
