Flip Distance Is in FPT Time O(n+ k * c^k)
From MaRDI portal
Publication:2955019
DOI10.4230/LIPIcs.STACS.2015.500zbMath1355.68280OpenAlexW2264222783MaRDI QIDQ2955019
Publication date: 24 January 2017
Full work available at URL: https://dx.doi.org/10.4230/LIPIcs.STACS.2015.500
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
On the parameterized complexity of reconfiguration of connected dominating sets ⋮ Computing the flip distance between triangulations ⋮ Flip distance between triangulations of a simple polygon is NP-complete ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An improved FPT algorithm for the flip distance problem ⋮ Introduction to reconfiguration
This page was built for publication: Flip Distance Is in FPT Time O(n+ k * c^k)
