Pages that link to "Item:Q3434562"
From MaRDI portal
The following pages link to Distance Approximating Trees: Complexity and Algorithms (Q3434562):
Displaying 15 items.
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- A distance approximating trees (Q948693) (← links)
- An optimal algorithm to reconstruct trees from additive distance data (Q1121819) (← links)
- On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← 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)
- Approximating geodesic tree distance (Q2379945) (← links)
- Extremal distances for subtree transfer operations in binary trees (Q2421307) (← links)
- Breakpoint Distance and PQ-Trees (Q3575241) (← links)
- (Q4218433) (← links)
- Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees (Q5111707) (← links)
- Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← 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)
