Consistent Subset Problem with Two Labels.

ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018(2018)

Cited 4|Views13
No score
Abstract
In this paper, we prove that the consistent subset problem with two labels is NP-complete.
More
Translated text
Key words
Minimal Consistent Subset, Negative Clause, Bottom Left Vertex, Path Points, Green Points
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined