Edge separators for quasi-binary trees - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2012

Edge separators for quasi-binary trees

Résumé

One wishes to remove $k-1$ edges of a vertex-weighted tree $T$ such that the weights of the $k$ induced connected components are approximately the same. How well can one do it ? In this paper, we investigate such $k$-separator for {\em quasi-binary} trees. We show that, under certain conditions on the total weight of the tree, a particular $k$-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.

Mots clés

Fichier principal
Vignette du fichier
Edge-separator-final.pdf (116.18 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00732772 , version 1 (17-09-2012)

Identifiants

Citer

Jorge Ramirez Alfonsin, Serge Tishchenko. Edge separators for quasi-binary trees. 2012. ⟨hal-00732772⟩
135 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More