Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174)

From MaRDI portal
Revision as of 21:18, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126814426, #quickstatements; #temporary_batch_1722280142910)
scientific article
Language Label Description Also known as
English
Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
scientific article

    Statements

    Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    \((k, m)\)-ary trees
    0 references
    ranking/unranking algorithms
    0 references
    Zaks' sequences
    0 references
    RD-sequences
    0 references
    lexicographic/reverse-lexicographic order
    0 references
    amortized cost
    0 references
    0 references
    0 references