A generalized algorithm for centrality problems on trees

DOI10.1145/62044.62051zbMath0674.90097OpenAlexW2068509096MaRDI QIDQ3829371

Arnon Rosenthal, José A. Pino

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

zbMATH Keywords

facility locationeccentricitylinear time algorithmroutingtree networkscentroidcentralitytree traversalcomputation on discrete structurescentralized networkr-domination problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Sorting weighted distances with applications to objective function evaluations in single facility location problems. ⋮ Collection depots facility location problems in trees ⋮ The normality and sum of normalities of trees ⋮ Some extremal problems on the distance involving peripheral vertices of trees with given matching number

This page was built for publication: A generalized algorithm for centrality problems on trees