An Eades-McKay algorithm for well-formed parentheses strings
From MaRDI portal
Publication:293461
DOI10.1016/S0020-0190(98)00171-9zbMath1339.68326MaRDI QIDQ293461
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001719?np=y
Related Items
Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ Flip-swap languages in binary reflected Gray code order ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Lexicographic generation of ordered trees
- A Survey on Binary Tree Codings
- Some Hamilton Paths and a Minimal Change Algorithm
- Generating binary trees by transpositions
- On Rotations and the Generation of Binary Trees
