Pages that link to "Item:Q1822974"
From MaRDI portal
The following pages link to Efficient algorithms for tree reconstruction (Q1822974):
Displaying 7 items.
- Generating binary trees with uniform probability (Q751300) (← links)
- Construction of a tree from its traversals in optimal time and space (Q910183) (← links)
- An optimal algorithm to reconstruct trees from additive distance data (Q1121819) (← links)
- An optimal algorithm for reconstructing a binary tree (Q1198037) (← links)
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time (Q1898217) (← links)
- Ordered trees and the inorder traversal (Q2502899) (← links)
- Efficient Schemes for Computing α-tree Representations (Q4925100) (← links)