New analysis and computational study for the planar connected dominating set problem (Q328712): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6641535 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch-decomposition based algorithms | |||
| Property / zbMATH Keywords: branch-decomposition based algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
connected dominating set | |||
| Property / zbMATH Keywords: connected dominating set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graphs | |||
| Property / zbMATH Keywords: planar graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed-parameter algorithms | |||
| Property / zbMATH Keywords: fixed-parameter algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational study | |||
| Property / zbMATH Keywords: computational study / rank | |||
Normal rank | |||
Revision as of 03:35, 28 June 2023
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
