Ranking and unranking trees with a given number or a given set of leaves

    2010.

    Cited by: 2|Bibtex|Views1|Links
    Keywords:
    complete graphspanning tree

    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 roug...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments