Edge separators for quasi-binary trees
Combinatorics
2012-09-18 v1
Abstract
One wishes to remove edges of a vertex-weighted tree such that the weights of the induced connected components are approximately the same. How well can one do it ? In this paper, we investigate such -separator for {\em quasi-binary} trees. We show that, under certain conditions on the total weight of the tree, a particular -separator can be constructed such that the smallest (respectively the largest) weighted component is lower (respectively upper) bounded. Examples showing optimality for the lower bound are also given.
Keywords
Cite
@article{arxiv.1209.3572,
title = {Edge separators for quasi-binary trees},
author = {Jorge Ramirez Alfonsin and Serge Tishchenko},
journal= {arXiv preprint arXiv:1209.3572},
year = {2012}
}