Computational Study on Dominating Set Problem of Planar Graphs (Q5505646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5498446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational Study on Dominating Set Problem of Planar Graphs |
scientific article; zbMATH DE number 5498446 |
Statements
Computational Study on Dominating Set Problem of Planar Graphs (English)
0 references
27 January 2009
0 references
PLANAR DOMINATING SET
0 references
branch-decomposition
0 references
fixed-parameter algorithms
0 references
data reduction
0 references
computational study
0 references
0.9861592650413512
0 references
0.8565604090690613
0 references
0.8480379581451416
0 references
0.8438640832901001
0 references
