Distance approximating spanning trees
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- Eccentricity-approximating trees in chordal graphs
- A note on distance approximating trees in graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Approximating geodesic tree distance
- Eccentricity 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
- Distance Approximating Trees: Complexity and Algorithms
- Distance defined by spanning trees in graphs
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Collective additive tree spanners for circle graphs and polygonal graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- The recognition problem of graph search trees
- scientific article; zbMATH DE number 6464021 (Why is no real title available?)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- scientific article; zbMATH DE number 7691269 (Why is no real title available?)
- Scattering and sparse partitions, and their applications
- Eccentricity function in distance-hereditary graphs
- Distance approximating trees for chordal and dually chordal graphs (extended abstract)
- A distance approximating trees
- Combinatorial network abstraction by trees and distances
This page was built for publication: Distance approximating spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048949)