3 citations · 3 across the 1 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
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 .…
cs.CG2025
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy +1
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least…