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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1857327936 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:12, 19 March 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
