2000 character limit reached
Ranking and unranking trees with a given number or a given set of leaves (1009.2060v1)
Published 10 Sep 2010 in math.CO
Abstract: In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed number k of leaves. For fixed k, the number of Cayley trees with n vertices and k leaves grows roughly as n! and hence the ranks have O(nlog_2(n)) bits. Our ranking and unranking algorithms require at most O(n2) comparisons of numbers less than or equal to n plus O(n) operations of multiplication, division, addition, substraction and comparision on numbers of length O(nlog(n)).