Contents
Give Determine a tree T with n points. For each non-empty point set X, define f(X) as the number of edges of the smallest connected block containing all points in X.
Given another
Contents
Give Determine a tree T with n points. For each non-empty point set X, define f(X) as the number of edges of the smallest connected block containing all points in X.
Given another