Loopless generation of \(k\)-ary tree sequences (Q1339380): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00149-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019444679 / 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: 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: A loopless algorithm for generating binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating t-ary trees in A-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: Generating binary trees using rotations / rank
 
Normal rank

Latest revision as of 10:45, 23 May 2024