Consistent Subset Problem with Two Labels.
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018(2018)
Abstract
In this paper, we prove that the consistent subset problem with two labels is NP-complete.
MoreTranslated text
Key words
Minimal Consistent Subset, Negative Clause, Bottom Left Vertex, Path Points, Green Points
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined