New analysis and computational study for the planar connected dominating set problem (Q328712)
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 6641535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New analysis and computational study for the planar connected dominating set problem |
scientific article; zbMATH DE number 6641535 |
Statements
New analysis and computational study for the planar connected dominating set problem (English)
0 references
20 October 2016
0 references
branch-decomposition based algorithms
0 references
connected dominating set
0 references
planar graphs
0 references
fixed-parameter algorithms
0 references
computational study
0 references
0 references
0 references
0 references
0.9332840442657472
0 references
0.8158541321754456
0 references
0.8147104382514954
0 references
0.7894168496131897
0 references
0.7851334810256958
0 references
