A generalized algorithm for centrality problems on trees
From MaRDI portal
Publication:3829371
DOI10.1145/62044.62051zbMath0674.90097MaRDI QIDQ3829371
Publication date: 1989
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/62044.62051
facility location; eccentricity; linear time algorithm; routing; tree networks; centroid; centrality; tree traversal; computation on discrete structures; centralized network; r-domination problem
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
Related Items
Collection depots facility location problems in trees, Sorting weighted distances with applications to objective function evaluations in single facility location problems., The normality and sum of normalities of trees