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…