w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees
From MaRDI portal
Publication:2958355
Recommendations
- The \(w\)-centroids and least \(w\)-central subtrees in weighted trees
- Least central subtrees, center, and centroid of a tree
- The weighted \(k\)-center problem in trees for fixed \(k\)
- The weighted \(k\)-center problem in trees for fixed \(k\)
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- Some structural properties of a least central subtree of a tree
- Some central subtree problems and applications of a classical technique of deriving the center of a tree
- scientific article; zbMATH DE number 5732600
- scientific article; zbMATH DE number 1186097
- Some remarks on centrality in the subtree graph of a tree
Cites work
Cited in
(7)- Some central subtree problems and applications of a classical technique of deriving the center of a tree
- A note on weighted rooted trees
- The weight balance function on trees
- scientific article; zbMATH DE number 2119414 (Why is no real title available?)
- The \(w\)-centroids and least \(w\)-central subtrees in weighted trees
- From vertex-telecenters to subtree-telecenters
- Balance in trees
This page was built for publication: w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958355)