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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-019-00469-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2983434262 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126814426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5013818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4557997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((k,m)\)-Catalan numbers and hook length polynomials for plane trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Unranking of AVL-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees with<i>n</i>nodes and<i>m</i>leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generation of different types of RNA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking of non-regular trees with a prescribed branching sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless algorithm for generating multiple binary tree sequences simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic generation of ordered trees / rank
 
Normal rank

Latest revision as of 07:38, 30 July 2024

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