On the intercluster distance of a tree metric
From MaRDI portal
Publication:861256
Recommendations
- A distance metric on binary trees using lattice-theoretic measures
- scientific article; zbMATH DE number 7651097
- The distance Laplacian spectral radius of clique trees
- Wasserstein distance and metric trees
- scientific article; zbMATH DE number 1775400
- The distance energy of clique trees
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
Cites work
- scientific article; zbMATH DE number 890671 (Why is no real title available?)
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A linear-time algorithm to compute a MAD tree of an interval graph
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- Approximation algorithms for some optimum communication spanning tree problems
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Approximation algorithms for the shortest total path length spanning tree problem
- Average distance in colored graphs
- Exact algorithms for minimum routing cost trees
- MAD trees and distance-hereditary graphs
- Optimum Communication Spanning Trees
- Spanning Trees and Optimization Problems
- The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
- The complexity of the network design problem
- Worst-Case Analysis of Network Design Problem Heuristics
Cited in
(3)
This page was built for publication: On the intercluster distance of a tree metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861256)