Finding the two-core of a tree

DOI10.1016/S0166-218X(85)80002-0zbMath0608.05026OpenAlexW4210342397MaRDI QIDQ1086244

Yehoshua Perl, Ronald I. Becker

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(85)80002-0

zbMATH Keywords

treeminimum sum of distancesquadratic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items

Extensive facility location problems on networks: an updated review, Two Paths Location of a Tree with Positive or Negative Weights, INDUCTIVE ALGORITHMS ON FINITE TREES, Two paths location of a tree with positive or negative weights, Locating tree-shaped facilities using the ordered median objective, Efficient algorithms for two generalized 2-median problems and the group median problem on trees, A review of extensive facility location in networks, Minimax regret path location on trees, Partial and perfect path covers of cographs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average height of binary trees and other simple trees
• Parallel concepts in graph theory
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for a core of a tree
• On the height of trees
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph