7 citations · 18 across the 11 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
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…
cs.DS2010★ 2 cited
Complexity of Splits Reconstruction for Low-Degree Trees
Serge Gaspers, Mathieu Liedloff, Maya Stein +1
Given a vertex-weighted tree T, the split of an edge xy in T is min{s_x(xy), s_y(xy)} where s_u(uv) is the sum of all weights of vertices that are closer to u than to v in T. Given…