New analysis and computational study for the planar connected dominating set problem (Q328712): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-015-9871-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9871-0 / rank | |||
Normal rank | |||
Latest revision as of 14:32, 9 December 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
0 references
0 references
0 references
0 references
0 references
