Distance approximating trees in graphs
From MaRDI portal
Recommendations
Cited in
(19)- A note on distance approximating trees in graphs
- Average distances on substitution trees
- An O(n n) time algorithm for computing the path-length distance between trees
- Approximating geodesic tree distance
- Fréchet distance between weighted rooted trees
- Characterization of the distance between subtrees of a tree by the associated tight span
- Tree-Like Structures in Graphs: A Metric Point of View
- On a quadratic programming problem involving distances in trees
- Distance defined by spanning trees in graphs
- Breakpoint Distance and PQ-Trees
- Duality between distant point and median of a tree network space
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- scientific article; zbMATH DE number 1107549 (Why is no real title available?)
- Degree resistance distance of trees with some given parameters
- scientific article; zbMATH DE number 6464021 (Why is no real title available?)
- Algorithms and Computation
- Constructing tree-child networks from distance matrices
- Distance approximating trees for chordal and dually chordal graphs (extended abstract)
- A distance approximating trees
This page was built for publication: Distance approximating trees in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741328)