Some properties of a centroid of a free tree

DOI10.1016/0020-0190(75)90055-1zbMath0313.68032OpenAlexW1990287270MaRDI QIDQ1220383

Andy N. C. Kang, David A. Ault

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90055-1

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items

A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint ⋮ Minimum status of series-reduced trees with given parameters ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Centering a spanning tree of a biconnected graph ⋮ A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ Minimum statuses of connected graphs with fixed maximum degree and order ⋮ Unnamed Item ⋮ Minimum status of trees with a given degree sequence ⋮ Does random tree puzzle produce Yule-Harding trees in the many-taxon limit? ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ Medians and centres of polyominoes ⋮ Spiders are status unique in trees ⋮ Statuses and branch-weights of weighted trees ⋮ Statuses and double branch weights of quadrangular outerplanar graphs ⋮ Another characterization of the centroid of a tree ⋮ Finding Safe Strategies for Competitive Diffusion on Trees ⋮ A conjecture on different central parts of binary trees

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Unnamed Item