1 paper · 1 filter
Reilly Browne, Hsien-Chih Chang
Given an unweighted graph G, the *minimum r-dominating set problem* asks for the smallest-cardinality subset S such that every vertex in G is within radius r of some vert…