Anjeneya Swami Kare

activity

20172026

most citedAlgorithms and hardness results for happy coloring problems

15 citations · 17 across the 7 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

On the Tractability of Defensive Alliance Problem

Sangam Balchandar Reddy, Anjeneya Swami Kare

Given a graph $G = (V, E)$ , a non-empty set $S \subseteq V$ is a defensive alliance, if for every vertex $v \in S$ , the majority of its closed neighbours are in $S$ , that is, $|N_G…

cs.DS2023

Approximation Algorithms for the Graph Burning on Cactus and Directed Trees

Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani

Given a graph $G = (V, E)$ , the problem of Graph Burning is to find a sequence of nodes from $V$ , called a burning sequence, to burn the whole graph. This is a discrete-step process,…