The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation

Yusupjan Habibulla, Jin-Hua Zhao, Hai-Jun Zhou

A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set…