New analysis and computational study for the planar connected dominating set problem (Q328712): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
Revision as of 20:59, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New analysis and computational study for the planar connected dominating set problem |
scientific article |
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
