5 papers · 1 filter
Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
Bubai Manna
In a connected simple graph G = (V(G),E(G)), each vertex is assigned one of c colors, where V(G) can be written as a union of a total of c subsets V_{1},...,V_{c} and V_{i} denotes…
Minimum Selective Subset on Some Graph Classes
Bubai Manna
In a connected simple graph G = (V(G),E(G)), each vertex is assigned a color from the set of colors C={1, 2,..., c}. The set of vertices V(G) is partitioned as V_1, V_2, ... ,V_c,…
Minimum Consistent Subset in Interval Graphs and Circle Graphs
Bubai Manna
In a connected simple graph G = (V,E), each vertex of V is colored by a color from the set of colors C={c1, c2,..., c_α}$. We take a subset S of V, such that for every vertex v in…
Minimum Strict Consistent Subset in Paths, Spiders, Combs and Trees
Bubai Manna
Let G be a simple connected graph with vertex set V(G) and edge set E(G. Each vertex of V(G) is colored by a color from the set of colors {c_1, c_2,\dots, c_α}. We take a subset S…
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 , consisting of a vertex set of size and an edge set .…