Distance approximating spanning trees
From MaRDI portal
Publication:5048949
DOI10.1007/BFB0023484zbMATH Open1498.05087OpenAlexW1550952795MaRDI QIDQ5048949FDOQ5048949
Authors: Erich Prisner
Publication date: 9 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0023484
Recommendations
Cites Work
Cited In (20)
- Distance approximating trees for chordal and dually chordal graphs (extended abstract)
- Title not available (Why is that?)
- Eccentricity approximating trees
- Distance Approximating Trees: Complexity and Algorithms
- Approximating geodesic tree distance
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- The recognition problem of graph search trees
- Combinatorial network abstraction by trees and distances
- Collective additive tree spanners for circle graphs and polygonal graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Distance defined by spanning trees in graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Title not available (Why is that?)
- Eccentricity function in distance-hereditary graphs
- A note on distance approximating trees in 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
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)