Pages that link to "Item:Q703564"
From MaRDI portal
The following pages link to Rotation sequences and edge-colouring of binary tree pairs (Q703564):
Displaying 6 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- On the rotation distance between binary trees (Q846983) (← links)
- Refined upper bounds for right-arm rotation distances (Q884484) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
