w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees

DOI10.1007/978-3-319-48749-6_50zbMATH Open1486.05046OpenAlexW2540391452MaRDI QIDQ2958355FDOQ2958355

Authors: Erfang Shan, Liying Kang 

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_50

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

zbMATH Keywords

tree\(w\)-centroid\((w,l)\)-central subtreeleast \((w,l)\)-central subtree

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Least central subtrees, center, and centroid of a tree
• A self-stabilizing algorithm for finding weighted centroid in trees
• The subtree center of a tree

Cited In (7)

• Some central subtree problems and applications of a classical technique of deriving the center of a tree
• The weight balance function on trees
• A note on weighted rooted trees
• Title not available (Why is that?)
• 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)