A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strengthened analysis of an algorithm for dominating set in planar graphs |
scientific article; zbMATH DE number 6033763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strengthened analysis of an algorithm for dominating set in planar graphs |
scientific article; zbMATH DE number 6033763 |
Statements
A strengthened analysis of an algorithm for dominating set in planar graphs (English)
0 references
11 May 2012
0 references
dominating set
0 references
planar graph
0 references
parameterized complexity
0 references
0.94006544
0 references
0.91888064
0 references
0.9147868
0 references
0.90998757
0 references
0.90837884
0 references
0 references
0.89618754
0 references
