Computational Study for Planar Connected Dominating Set Problem (Q3066449): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60402521, #quickstatements; #temporary_batch_1705835156834 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:47, 3 February 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
