1 citations · 1 across the 3 of their papers we have counts for
3 papers
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity +2
In this paper we study a maximization version of the classical Feedback Vertex Set (FVS) problem, namely, the Max Min FVS problem, in the realm of parameterized complexity. In this…
Parameterized Complexity of Locally Minimal Defensive Alliances
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
A set of vertices of a graph is a defensive alliance if, for each element of , the majority of its neighbours is in . We consider the notion of local minimality in this p…
The Satisfactory Partition Problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at l…