Computational study for planar connected dominating set problem (Q3066449)
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 5834498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational study for planar connected dominating set problem |
scientific article; zbMATH DE number 5834498 |
Statements
Computational Study for Planar Connected Dominating Set Problem (English)
0 references
10 January 2011
0 references
branch-decomposition based algorithms
0 references
CDS problem
0 references
planar graphs
0 references
fixed-parameter algorithms
0 references
computational study
0 references
0.9332840442657472
0 references
0.8571766018867493
0 references
0.8565604090690613
0 references
0.7805281281471252
0 references
0.7800551652908325
0 references
