Pages that link to "Item:Q1582482"
From MaRDI portal
The following pages link to A note on distance approximating trees in graphs (Q1582482):
Displaying 20 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- A distance approximating trees (Q948693) (← links)
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \) (Q2124229) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Approximating geodesic tree distance (Q2379945) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Characterization of the distance between subtrees of a tree by the associated tight span (Q2494462) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Distance approximating trees in graphs (Q2741328) (← links)
- Tree-Like Structures in Graphs: A Metric Point of View (Q2864284) (← links)
- (Q3754029) (← links)
- Duality between distant point and median of a tree network space (Q3827771) (← links)
- (Q4005191) (← links)
- Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
- Distance approximating spanning trees (Q5048949) (← links)
- Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs (Q5301013) (← links)
- The intrinsic dimensionality of graphs (Q5900392) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
