On generating \(k\)-ary trees in computer representation (Q1603407): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Limin Xiang / rank
Normal rank
 
Property / author
 
Property / author: Kazuo Ushijima / rank
Normal rank
 
Property / author
 
Property / author: Chang-jie Tang / rank
Normal rank
 
Property / author
 
Property / author: Limin Xiang / rank
 
Normal rank
Property / author
 
Property / author: Kazuo Ushijima / rank
 
Normal rank
Property / author
 
Property / author: Chang-jie Tang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of binary trees / 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: A Loopless Gray-Code Algorithm for Listing k-ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Ordered Trees Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Generation of k-ary Trees in Natural Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numbering system for binary trees / 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: Loopless generation of Gray codes for \(k\)-ary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifts and loopless generation of \(k\)-ary trees / 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: 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: Generation of Binary Trees from Ballot Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating <i>t</i>-Ary Trees Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the loopless generation of binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-Oriented Enumeration of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient loopless generation of Gray codes for \(k\)-ary trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Regular k-ary Trees Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic generation of ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees using rotations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:47, 4 June 2024

scientific article
Language Label Description Also known as
English
On generating \(k\)-ary trees in computer representation
scientific article

    Statements

    On generating \(k\)-ary trees in computer representation (English)
    0 references
    14 July 2002
    0 references
    0 references
    computer representation
    0 references
    loopless generation
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references