On the polynomiality of finding KDMDGP re-orders.

Carlile Lavor, Michael Souza, Luiz Mariano Carvalho, Leo Liberti

Discrete Applied Mathematics（2019）

引用 16|浏览43

暂无评分

摘要

In Cassioli et al. (2015), the complexity of finding KDMDGP re-orders was stated to be NP-complete by inclusion, which fails to provide a complete picture. In this paper we show that this problem is indeed NP-complete for K=1, but it is in P for each fixed K≥2.

查看译文

关键词

Distance Geometry,Discretizable Molecular Distance Geometry Problem,Vertex orders

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要