Flip distance is in FPT time \(O(n+ k \cdot c^k)\) (Q2955019)
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: Flip distance is in FPT time O(n+ k c^k) |
scientific article; zbMATH DE number 6677418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flip distance is in FPT time \(O(n+ k \cdot c^k)\) |
scientific article; zbMATH DE number 6677418 |
Statements
24 January 2017
0 references
triangulations
0 references
flip distance
0 references
parameterized algorithms
0 references
Flip Distance Is in FPT Time O(n+ k * c^k) (English)
0 references
0.9427192807197572
0 references
0.9327125549316406
0 references
0.875156044960022
0 references
