New Complexity Bounds and Faster Algorithm for Minimum Consistent Subsets

MCS remains NP‑complete on trees when the number of colors is a parameter; a new FPT algorithm solves it in O(2^{6c} n^6), better than O(2^{4c} n^{2c+3}) Read more: getnews.me/new-complexity-bounds-an... #graphalgorithms #parameterizedcomplexity