Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Loopless generation of \(k\)-ary tree sequences
@@ Property / cites work: Loopless generation of \(k\)-ary tree sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Loopless generation of Gray codes for \(k\)-ary trees
+Normal rank
@@ Property / cites work @@
+Shifts and loopless generation of \(k\)-ary trees
@@ Property / cites work: Shifts and loopless generation of \(k\)-ary trees / rank @@
+Normal rank
@@ Property / cites work @@
+On Rotations and the Generation of Binary Trees
@@ Property / cites work: On Rotations and the Generation of Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating, Ranking and Unranking Binary Trees
@@ Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the loopless generation of binary tree sequences
+Normal rank
@@ Property / cites work @@
+A loopless algorithm for generating binary tree sequences
+Normal rank
@@ Property / cites work @@
+A Loopless Gray-Code Algorithm for Listing k-ary Trees
+Normal rank
@@ Property / cites work @@
+Q3791180
@@ Property / cites work: Q3791180 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552272
@@ Property / cites work: Q4552272 / rank @@
+Normal rank
@@ Property / cites work @@
+Grammar-Oriented Enumeration of Binary Trees
@@ Property / cites work: Grammar-Oriented Enumeration of Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On generating \(k\)-ary trees in computer representation
+Normal rank
@@ Property / cites work @@
+Lexicographic generation of ordered trees
@@ Property / cites work: Lexicographic generation of ordered trees / rank @@
+Normal rank
@@ Property / cites work @@
+Generating binary trees using rotations
@@ Property / cites work: Generating binary trees using rotations / rank @@
+Normal rank