New Complexity and Algorithmic Bounds for Minimum Consistent Subsets

Aritra Banik, Sayani Das, Anil Maheshwari +6

In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph $G=(V,E)$, consisting of a vertex set $V$ of size $n$ and an edge set $E$.…