Computer Science – Discrete Mathematics
Scientific paper
2009-11-14
Computer Science
Discrete Mathematics
Scientific paper
A tree T_uni is m-universal for the class of trees if for every tree T of
size m, T can be obtained from T_uni by successive contractions of edges. We
prove that a m-universal tree for the class of trees has at least mln(m) +
(gamma-1)m + O(1) edges where is the Euler's constant and we build such a tree
with less than mc edges for a fixed constant c = 1.984...
No associations
LandOfFree
On the Minimum Size of a Contraction-Universal Tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Minimum Size of a Contraction-Universal Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Minimum Size of a Contraction-Universal Tree will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-323501