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

DOI10.1007/978-3-319-48749-6_50zbMath1486.05046OpenAlexW2540391452MaRDI QIDQ2958355

Erfang Shan, Li-ying 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

zbMATH Keywords

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

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

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

This page was built for publication: w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees