An improved FPT algorithm for the flip distance problem
From MaRDI portal
Publication:2051774
DOI10.1016/j.ic.2021.104708OpenAlexW3131734319MaRDI QIDQ2051774
Jianxin Wang, Qilong Feng, Shao-hua Li, Xiangzhong Meng
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8110/
Related Items
A survey of parameterized algorithms and the complexity of edge modification ⋮ An improved kernel for the flip distance problem on simple convex polygons
Cites Work
- Unnamed Item
- Unnamed Item
- An improved kernel size for rotation distance in binary trees
- Flip distance between triangulations of a simple polygon is NP-complete
- Flip distance between two triangulations of a point set is NP-complete
- Flipping edges in triangulations
- Using nondeterminism to design efficient deterministic algorithms
- A lower bound on the number of triangulations of planar point sets
- Computing the flip distance between triangulations
- Flip distance between triangulations of a planar point set is APX-hard
- Transforming triangulations
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Flip Distance Is in FPT Time O(n+ k * c^k)
- Modeling contours of trivariate data
- Parameterized Algorithms
This page was built for publication: An improved FPT algorithm for the flip distance problem
