Equal Splits of Vertex-Weighted Trees
Combinatorics
2020-11-13 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2011.06482,
title = {Equal Splits of Vertex-Weighted Trees},
author = {Corinne Mulvey},
journal= {arXiv preprint arXiv:2011.06482},
year = {2020}
}
Comments
6 pages, 4 figures, mentored by Diana Davis