15 citations · 19 across the 10 of their papers we have counts for
11 papers
On the complexity of global Roman domination problem in graphs
Sangam Balchandar Reddy, Arun Kumar Das, Anjeneya Swami Kare +1
A Roman dominating function of a graph is a labeling such that for each vertex with , there exists a vertex $v \in N(…
Algorithms for Minimum Membership Dominating Set Problem
Sangam Balchandar Reddy, Anjeneya Swami Kare
Given a graph and an integer , the Minimum Membership Dominating Set problem asks to compute a set such that for each , $1 \leq |N[v] \cap…
Interest Maximization in Social Networks
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Nowadays, organizations use viral marketing strategies to promote their products through social networks. It is expensive to directly send the product promotional information to al…
On the Tractability of Defensive Alliance Problem
Sangam Balchandar Reddy, Anjeneya Swami Kare
Given a graph , a non-empty set is a defensive alliance, if for every vertex , the majority of its closed neighbours are in , that is, $|N_G…
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Given a graph , the problem of Graph Burning is to find a sequence of nodes from , called a burning sequence, to burn the whole graph. This is a discrete-step process,…
Improved Approximation Algorithm for Graph Burning on Trees
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S
Given a graph , the problem of \gb{} is to find a sequence of nodes from , called burning sequence, in order to burn the whole graph. This is a discrete-step process, i…
Faster Heuristics for Graph Burning
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Graph burning is a process of information spreading through the network by an agent in discrete steps. The problem is to find an optimal sequence of nodes which have to be given in…
Bipartitioning Problems on Graphs with Bounded Tree-Width
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induc…
On the Tractability of (k,i)-Coloring
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram +1
In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-col…
Algorithms and hardness results for happy coloring problems
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare +1
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of…
A Simple Algorithm For Replacement Paths Problem
Anjeneya Swami Kare
Let G=(V,E)(|V|=n and |E|=m) be an undirected graph with positive edge weights. Let P_{G}(s, t) be a shortest s-t path in G. Let l be the number of edges in P_{G}(s, t). The \emph{…