Ranking and Unranking of Non-regular Trees (Q3792254): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of calculating factorials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Generating Well-formed Parenthesis Strings Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Ordered Trees Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic Enumeration of k-ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Unranking of 2-3 Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking of B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees of bounded height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on generating binary trees in<i>A</i>-order and<i>B</i>-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Trees and Other Combinatorial Objects Lexicographically / rank
 
Normal rank

Latest revision as of 16:50, 18 June 2024

scientific article
Language Label Description Also known as
English
Ranking and Unranking of Non-regular Trees
scientific article

    Statements

    Identifiers