Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes (Q6486931)
From MaRDI portal
(Redirected from Item:Q2930282)
 | 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: Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes |
scientific article; zbMATH DE number 6370620
- Exponential time algorithms for the minimum dominating set problem on some graph classes
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes |
scientific article; zbMATH DE number 6370620 |
|
Statements
Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes (English)
0 references
Exponential time algorithms for the minimum dominating set problem on some graph classes (English)
0 references
18 November 2014
0 references
moderately exponential time algorithms
0 references
dominating set problem
0 references
graph classes
0 references
0.9945921
0 references
0.9251502
0 references
0.9106529
0 references
0.9049846
0 references
0.8997112
0 references
0.8947796
0 references
0.8943405
0 references
0 references
