A note on distance approximating trees in graphs
From MaRDI portal
DOI10.1006/EUJC.1999.0381zbMATH Open0958.05046OpenAlexW2029803751MaRDI QIDQ1582482FDOQ1582482
Authors: Victor Chepoi, Feodor F. Dragan 
Publication date: 30 March 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1999.0381
Recommendations
Cites Work
Cited In (20)
- Tree-Like Structures in Graphs: A Metric Point of View
- Distance approximating trees in graphs
- Duality between distant point and median of a tree network space
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \)
- Title not available (Why is that?)
- Distance Approximating Trees: Complexity and Algorithms
- Approximating geodesic tree distance
- Distance approximating spanning trees
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- The intrinsic dimensionality of graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Spanners for bounded tree-length graphs
- A distance approximating trees
- Characterization of the distance between subtrees of a tree by the associated tight span
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Tree-decompositions with bags of small diameter
- Title not available (Why is that?)
This page was built for publication: A note on distance approximating trees in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582482)
