Pages that link to "Item:Q5024666"
From MaRDI portal
The following pages link to Determining the Hausdorff Distance Between Trees in Polynomial Time (Q5024666):
Displaying 6 items.
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (Q2319639) (← links)
- An efficient algorithm for the rooted triplet distance between galled trees (Q2364900) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- Computing the Gromov-Hausdorff Distance for Metric Trees (Q3459891) (← links)
- Breakpoint Distance and PQ-Trees (Q3575241) (← links)