A refined search tree technique for dominating set on planar graphs (Q2575830)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2235951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A refined search tree technique for dominating set on planar graphs |
scientific article; zbMATH DE number 2235951 |
Statements
A refined search tree technique for dominating set on planar graphs (English)
0 references
7 December 2005
0 references
NP-complete problem
0 references
Dominating set
0 references
Planar graph
0 references
Fixed-parameter tractability
0 references
Exact algorithm
0 references
Search tree
0 references
0 references
0.90998757
0 references
0 references
0.8951349
0 references
0.89472216
0 references
0.8918253
0 references
0 references
