Anjeneya Swami Kare

collaborators

3 papers

math.CO2026

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 $G = (V, E)$ is a labeling $f : V \to {0, 1, 2}$ such that for each vertex $u \in V$ with $f (u) = 0$ , there exists a vertex $v \in N(…

cs.SI2024

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…

cs.DS2024

Algorithms for Minimum Membership Dominating Set Problem

Sangam Balchandar Reddy, Anjeneya Swami Kare

Given a graph $G = (V, E)$ and an integer $k$ , the Minimum Membership Dominating Set problem asks to compute a set $S \subseteq V$ such that for each $v \in V$ , $1 \leq |N[v] \cap…