Pages that link to "Item:Q910191"
From MaRDI portal
The following pages link to A distance metric on binary trees using lattice-theoretic measures (Q910191):
Displaying 15 items.
- Two shortest path metrics on well-formed parentheses strings (Q286951) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- On the rotation distance between binary trees (Q846983) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- Metrics on the multirubric lattice of a rubricator tree (Q1615759) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- Extremal distances for subtree transfer operations in binary trees (Q2421307) (← links)
- Decision trees of algorithms and a semivaluation to measure their distance (Q2863890) (← links)
- An algorithm to compute the möbius function of the rotation lattice of binary trees (Q3142268) (← links)
- Computing the Gromov-Hausdorff Distance for Metric Trees (Q3459891) (← links)
- Matchings In Three Catalan Lattices (Q4805933) (← links)
- The higher Stasheff‐Tamari posets (Q4895411) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5901089) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
