A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set

A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no vertices in D are pairwise adjacent, then D is said to be an independent dominating set. Finding a minimum independent dominating set in a graph is an NP-hard problem. We give an algorithm computing a minimum independent dominating

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Serge Gaspers, Mathieu Liedloff
• Keywords: CORR 2010, Dominating Set, Education, NP-hard Problem