An improved FPT algorithm for the flip distance problem
type: Item
instance of: scholarly article
title: An improved FPT algorithm for the flip distance problem
author: Qilong Feng
author: Shao-Hua Li
author: Xiangzhong Meng
author: Jianxin Wang
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8110/
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433285
MaRDI profile type: Publication
OpenAlex ID: W3131734319
cites work: A lower bound on the number of triangulations of planar point sets
cites work: Flip distance between triangulations of a simple polygon is NP-complete
cites work: Parameterized computation and complexity: a new approach dealing with NP-hardness
cites work: Using nondeterminism to design efficient deterministic algorithms
cites work: Parameterized Algorithms
cites work: Q5452284
cites work: Q4256595
cites work: Modeling contours of trivariate data
cites work: Flipping edges in triangulations
cites work: Computing the flip distance between triangulations
cites work: Flip Distance Is in FPT Time O(n+ k * c^k)
cites work: Transforming triangulations
cites work: Flip distance between two triangulations of a point set is NP-complete
cites work: An improved kernel size for rotation distance in binary trees
cites work: Flip distance between triangulations of a planar point set is APX-hard
DOI: 10.1016/J.IC.2021.104708
description: scientific article; zbMATH DE number 7433285