Ranking and unrankingk-ary trees with a 4k –4 letter alphabet (Q4366347): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02522667.1997.10699333
+Normal rank
@@ Property / OpenAlex ID @@
+W2077492027
@@ Property / OpenAlex ID: W2077492027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / 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 @@
+A-order generation of k-ary trees with a 4k–4 letter alphabet
+Normal rank
@@ Property / cites work @@
+Generating trees with<i>n</i>nodes and<i>m</i>leaves
+Normal rank
@@ Property / cites work @@
+Coding Binary Trees by Words over an Alphabet with Four Letters
+Normal rank
@@ Property / cites work @@
+Generating t-ary trees in A-order
@@ Property / cites work: Generating t-ary trees in A-order / rank @@
+Normal rank
@@ Property / cites work @@
+Generating binary trees in A-order from codewords defined on a four-letter alphabet
+Normal rank
@@ Property / cites work @@
+Lexicographic generation of ordered trees
@@ Property / cites work: Lexicographic generation of ordered trees / rank @@
+Normal rank

Ranking and unranking<i>k</i>-ary trees with a 4<i>k –</i>4 letter alphabet (Q4366347): Difference between revisions