Efficient dominating set using branching

90 Views Asked by At

Exact dominating set is a dominating set in which exactly one element of N[v] belongs to dominating set.I have used branching to find a solution.if a vertex v is selected then N[v] is deleted and N^2(v) is colored blue.I am not sure if my solution is correct I am attaching my solution solution

0

There are 0 best solutions below