1 citations · 1 across the 17 of their papers we have counts for
1 paper · 2 filters
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
We study the parameterized complexity of transforming graphs into Uniform Cluster graphs, where each component is an equal-sized clique. We consider Uniform Cluster Vertex Deletion…