On the loopless generation of binary tree sequences (Q293424): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Gray Code for the Ideals of a Forest Poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless generation of \(k\)-ary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rotation graph of binary trees is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rotations and the Generation of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless algorithm for generating binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees by transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees using rotations / rank
 
Normal rank

Latest revision as of 02:39, 12 July 2024

scientific article
Language Label Description Also known as
English
On the loopless generation of binary tree sequences
scientific article

    Statements

    On the loopless generation of binary tree sequences (English)
    0 references
    9 June 2016
    0 references
    loopless generating algorithms
    0 references
    binary tree sequences
    0 references
    combinatorial problems
    0 references
    design of algorithms
    0 references

    Identifiers