Sounaka Mishra

activity

20142023

most citedFO and MSO approach to Some Graph Problems: Approximation and Poly time Results

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing cs.CCShow all

1 paper · 1 filter

cs.CC2023

Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results

Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda

A set $D \subseteq V$ of a graph $G = (V, E)$ is a dominating set of $G$ if each vertex $v \in V ∖ D$ is adjacent to at least one vertex in $D,$ whereas a set $D_{2} \subseteq V$ …