An Eades-McKay algorithm for well-formed parentheses strings (Q293461): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5202662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Hamilton Paths and a Minimal Change Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for generating subsets of fixed size with a strong minimal change property / 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: A Survey on Binary Tree Codings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4268449 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generating binary trees by transpositions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lexicographic generation of ordered trees / rank | |||
Normal rank |
Latest revision as of 02:39, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Eades-McKay algorithm for well-formed parentheses strings |
scientific article |
Statements
An Eades-McKay algorithm for well-formed parentheses strings (English)
0 references
9 June 2016
0 references
parentheses strings
0 references
Gray code
0 references
transposition
0 references
0 references