Pages that link to "Item:Q4228290"
From MaRDI portal
The following pages link to Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290):
Displaying 33 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Distance approximating trees for chordal and dually chordal graphs (extended abstract) (Q826072) (← links)
- A distance approximating trees (Q948693) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- A note on distance approximating trees in graphs (Q1582482) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Easy computation of eccentricity approximating trees (Q1741520) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- On the hyperbolicity constant of circular-arc graphs (Q2420429) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- Distance approximating trees in graphs (Q2741328) (← links)
- Determining possible sets of leaves for spanning trees of dually chordal graphs. (Q2823194) (← links)
- Comparing trees characteristic to chordal and dually chordal graphs (Q2840679) (← links)
- Eccentricity Approximating Trees (Q3181054) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- Duality between distant point and median of a tree network space (Q3827771) (← links)
- Optimal tree 3-spanners in directed path graphs (Q4267388) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Distance approximating spanning trees (Q5048949) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- The intrinsic dimensionality of graphs (Q5900392) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
