Consistent Subset Problem with Two Labels.

ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018（2018）

引用 4|浏览11

暂无评分

摘要

In this paper, we prove that the consistent subset problem with two labels is NP-complete.

查看译文

关键词

Minimal Consistent Subset, Negative Clause, Bottom Left Vertex, Path Points, Green Points

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要