Pages that link to "Item:Q2741328"
From MaRDI portal
The following pages link to Distance approximating trees in graphs (Q2741328):
Displaying 19 items.
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- Constructing tree-child networks from distance matrices (Q724232) (← links)
- Distance approximating trees for chordal and dually chordal graphs (extended abstract) (Q826072) (← links)
- A distance approximating trees (Q948693) (← links)
- A note on distance approximating trees in graphs (Q1582482) (← links)
- Average distances on substitution trees (Q2162089) (← links)
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (Q2319639) (← links)
- Approximating geodesic tree distance (Q2379945) (← links)
- Fréchet distance between weighted rooted trees (Q2414378) (← links)
- Characterization of the distance between subtrees of a tree by the associated tight span (Q2494462) (← links)
- Tree-Like Structures in Graphs: A Metric Point of View (Q2864284) (← links)
- Distance defined by spanning trees in graphs (Q3504801) (← links)
- Breakpoint Distance and PQ-Trees (Q3575241) (← links)
- Duality between distant point and median of a tree network space (Q3827771) (← links)
- Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
- (Q4373478) (← links)
- Degree resistance distance of trees with some given parameters (Q5135471) (← links)
- (Q5265414) (← links)
- Algorithms and Computation (Q5897941) (← links)