Distance Approximating Trees for Chordal and Dually Chordal Graphs
From MaRDI portal
Recommendations
- Distance approximating trees for chordal and dually chordal graphs (extended abstract)
- Distance approximating trees in graphs
- A note on distance approximating trees in graphs
- Distance Approximating Trees: Complexity and Algorithms
- Eccentricity-approximating trees in chordal graphs
- On distances in vertex-weighted trees
- Distance approximating spanning trees
- Tree spanners on chordal graphs: complexity and algorithms
- On the correspondence between tree representations of chordal and dually chordal graphs
- Computing graph distances parameterized by treewidth and diameter
Cited in
(34)- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- A note on distance approximating trees in graphs
- Tree spanners of bounded degree graphs
- Easy computation of eccentricity approximating trees
- Tree spanners on chordal graphs: complexity and algorithms
- An improved algorithm for computing all the best swap edges of a tree spanner
- New results on pairwise compatibility graphs
- Reconstruction and verification of chordal graphs with a distance oracle
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Eccentricity approximating trees
- On the hyperbolicity constant of circular-arc graphs
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- Distance approximating trees in graphs
- Determining possible sets of leaves for spanning trees of dually chordal graphs.
- Comparing trees characteristic to chordal and dually chordal graphs
- Eccentricity approximating trees (extended abstract)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner
- Duality between distant point and median of a tree network space
- Optimal tree 3-spanners in directed path graphs
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Fast diameter computation within split graphs
- Distance approximating spanning trees
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- The intrinsic dimensionality of graphs
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Tree 3-spanners on generalized prisms of graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Scattering and sparse partitions, and their applications
- Distance approximating trees for chordal and dually chordal graphs (extended abstract)
- A distance approximating trees
This page was built for publication: Distance Approximating Trees for Chordal and Dually Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228290)
