Pages that link to "Item:Q5048949"
From MaRDI portal
The following pages link to Distance approximating spanning trees (Q5048949):
Displaying 20 items.
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- Distance approximating trees for chordal and dually chordal graphs (extended abstract) (Q826072) (← links)
- A distance approximating trees (Q948693) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Eccentricity-approximating trees in chordal graphs (Q1567628) (← links)
- A note on distance approximating trees in graphs (Q1582482) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Approximating geodesic tree distance (Q2379945) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- Characterization of the distance between subtrees of a tree by the associated tight span (Q2494462) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Distance defined by spanning trees in graphs (Q3504801) (← links)
- Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- (Q5265414) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- (Q6159345) (← links)
