论文标题
平等的顶点加权树木
Equal Splits of Vertex-Weighted Trees
论文作者
论文摘要
给定加权顶点树，有时可以在允许的错误中将树分解为两个同样加权的子树。我们给出了一种快速算法，该算法找到了将树碎成同等重量组件或确定没有这种边缘的边缘。
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or determines there is no such edge.
