On enumerating tree permutations in natural order (Q3804211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Note on Generating Well-formed Parenthesis Strings Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numbering system for binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Binary Trees from Ballot Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of all the balanced parenthesis strings in lexicographical order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Listing Algorithms for <i>k</i>-Ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic generation of ordered trees / rank
 
Normal rank

Latest revision as of 18:25, 18 June 2024

scientific article
Language Label Description Also known as
English
On enumerating tree permutations in natural order
scientific article

    Statements

    On enumerating tree permutations in natural order (English)
    0 references
    0 references
    1987
    0 references
    lexicographical order
    0 references
    tree permutations
    0 references
    natural order
    0 references
    enumeration
    0 references
    binary tree
    0 references

    Identifiers