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 this page instead for the normal view: New analysis and computational study for the planar connected dominating set problem |
scientific article; zbMATH DE number 6641535
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 references
0 references
