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

Serge Gaspers, Mathieu Liedloff

An independent 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 neighbor in D and D is an independent set, i.e. no two…