Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up (Q3434987)
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 5149215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up |
scientific article; zbMATH DE number 5149215 |
Statements
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up (English)
0 references
3 May 2007
0 references
tree-width
0 references
graph algorithms
0 references
fixed-parameter algorithm
0 references
graph minors
0 references
0.8859572410583496
0 references
0.8573499321937561
0 references
0.8484282493591309
0 references
