Maintaining centdians in a fully dynamic forest with top trees
From MaRDI portal
Publication:479062
DOI10.1016/j.dam.2014.09.013zbMath1304.68036OpenAlexW1991526858MaRDI QIDQ479062
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.013
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic and static algorithms for optimal placement of resources in a tree
- A data structure for dynamic trees
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Maintaining information in fully dynamic trees with top trees
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Duality in the Cent-Dian of a Graph
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- A polynomial algorithm for thep-centdian problem on a tree
- The backup 2‐center and backup 2‐median problems on trees