The \(w\)-centroids and least \(w\)-central subtrees in weighted trees

DOI10.1007/s10878-017-0174-5zbMath1410.05023OpenAlexW2762136414MaRDI QIDQ1631665

Erfang Shan, Li-ying Kang

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0174-5

zbMATH Keywords

\(w\)-central subtree\(w\)-centroidleast \(w\)-central subtree

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• \((r,p)\)-centroid problems on paths and trees
• A self-stabilizing algorithm for finding weighted centroid in trees
• Least central subtrees, center, and centroid of a tree
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Overview of Representative Problems in Location Research
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Centroids to centers in trees
• The subtree center of a tree
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The \(w\)-centroids and least \(w\)-central subtrees in weighted trees