Minimum consistent subset of simple graph classes
Article Type
Research Article
Publication Title
Discrete Applied Mathematics
Abstract
In the minimum consistent subset (MCS) problem, a connected simple undirected graph G=(V,E) is given whose each vertex is colored by one of the colors {c1,c2,…,ck}, and the objective is to compute a minimum size subset C⊆V such that for each vertex v∈V, its set of nearest neighbors in C (with respect to the hop-distance) contains at least one vertex of the same color as v. The decision version of the MCS problem is NP-complete for general graphs. Even for planar graphs, the problem remains NP-complete. We will consider some simple graph classes like path, spider, caterpillar and comb; and present polynomial-time algorithms.
First Page
255
Last Page
277
DOI
https://10.1016/j.dam.2023.05.024
Publication Date
10-30-2023
Recommended Citation
Dey, Sanjana; Maheshwari, Anil; and Nandy, Subhas C., "Minimum consistent subset of simple graph classes" (2023). Journal Articles. 3530.
https://digitalcommons.isical.ac.in/journal-articles/3530
