Binary tree gray codes

DOI10.1016/0196-6774(85)90040-9MaRDI QIDQ3723712zbMATH OpenOpenAlexFDO

Authors Andrzej Proskurowski, Frank Ruskey

Publication date 1985

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(85)90040-9

zbMATH Keywords

Pascal programranking and unranking algorithmswell-formed parentheses strings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• Generating binary trees by transpositions
• Generating a Gray code for P-sequences
• On the generation of binary trees from (0–1) codes
• Generation of binary trees from (0-1) codes
• A note on the generation of binary trees

Cited in

(25)

• On the generation of binary trees from (0–1) codes
• Generating binary trees using rotations
• Gray codes for reflection groups
• On Rotations and the Generation of Binary Trees
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• scientific article; zbMATH DE number 4062616 (Why is no real title available?)
• Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
• Encoding trees by linear recurrence sequences
• Greedy Gray codes for Dyck words and ballot sequences
• An Eades-McKay algorithm for well-formed parentheses strings
• On the loopless generation of binary tree sequences
• Efficient coroutine generation of constrained Gray sequences
• Left distance binary tree representations
• Optimal binary search trees
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• A loopless algorithm for generating binary tree sequences
• Generation and enumeration of all solutions of the characteristic sum condition
• Generating a Gray code for P-sequences
• Binary Gray codes with long bit runs
• Ranking trees generated by rotations
• Finding parity difference by involutions
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• scientific article; zbMATH DE number 1823192 (Why is no real title available?)
• Generating binary trees by transpositions

This page was built for publication: Binary tree gray codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3723712)