An improved FPT algorithm for the flip distance problem
From MaRDI portal
Publication:2051774
Recommendations
Cites work
- A lower bound on the number of triangulations of planar point sets
- An improved kernel size for rotation distance in binary trees
- Computational geometry. Algorithms and applications.
- Computing the flip distance between triangulations
- Flip distance between triangulations of a planar point set is APX-hard
- Flip distance between two triangulations of a point set is NP-complete
- Flip distance is in FPT time O(n+ k c^k)
- Flipping edges in triangulations
- scientific article; zbMATH DE number 1317748 (Why is no real title available?)
- Modeling contours of trivariate data
- Parameterized algorithms
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Transforming triangulations
- Using nondeterminism to design efficient deterministic algorithms
Cited in
(8)- Computing the flip distance between triangulations
- Flip distance is in FPT time O(n+ k c^k)
- scientific article; zbMATH DE number 7204399 (Why is no real title available?)
- A survey of parameterized algorithms and the complexity of edge modification
- An improved kernel for the flip distance problem on simple convex polygons
- An \(\mathcal{O}(3.82^k)\) time \(\mathcal{FPT}\) algorithm for convex flip distance
- An \(\mathcal{O}(3.82^k)\) time \(\mathsf{FPT}\) algorithm for convex flip distance
- Flip distance between two triangulations of a point set is NP-complete
This page was built for publication: An improved FPT algorithm for the flip distance problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051774)
