Computational Study for Planar Connected Dominating Set Problem (Q3066449): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q60402521, #quickstatements; #temporary_batch_1705835156834 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60402521 / rank | |||
Normal rank | |||
Revision as of 12:26, 21 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Study for Planar Connected Dominating Set Problem |
scientific article |
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
