A generalized algorithm for centrality problems on trees
From MaRDI portal
Recommendations
Cited in
(14)- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Algorithms for path medi-centers of a tree
- Center problems with pos/neg weights on trees
- Some extremal problems on the distance involving peripheral vertices of trees with given matching number
- The normality and sum of normalities of trees
- INDUCTIVE ALGORITHMS ON FINITE TREES
- Maximin Center of Pendant Vertices in a Tree Network
- Collection depots facility location problems in trees
- A linear algorithm for finding the k‐broadcast center of a tree
- Some central subtree problems and applications of a classical technique of deriving the center of a tree
- Ranking trees based on global centrality measures
- A new linear-time algorithm for centroid decomposition
- Closeness centrality reconstruction of tree graphs
- k-Eccentricity and absolute k-centrum of a probabilistic tree
This page was built for publication: A generalized algorithm for centrality problems on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829371)