Maintaining centdians in a fully dynamic forest with top trees

DOI10.1016/J.DAM.2014.09.013MaRDI QIDQ479062zbMATH OpenOpenAlexFDO

Authors Hung-Lung Wang

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

zbMATH Keywords

nonlocal searchcentdianfully dynamic foresttop tree

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1617247
• Maintaining information in fully dynamic trees with top trees
• Maintaining minimum spanning forests in dynamic graphs
• Faster Fully-Dynamic Minimum Spanning Forest
• Maintenance of a minimum spanning forest in a dynamic plane graph

Cites work

• scientific article; zbMATH DE number 1617247 (Why is no real title available?)
• scientific article; zbMATH DE number 871916 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A data structure for dynamic trees
• A polynomial algorithm for thep-centdian problem on a tree
• Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Duality in the Cent-Dian of a Graph
• Dynamic and static algorithms for optimal placement of resources in a tree
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Maintaining information in fully dynamic trees with top trees
• The backup 2‐center and backup 2‐median problems on trees

Cited in

(1)

• scientific article; zbMATH DE number 1617247 (Why is no real title available?)

This page was built for publication: Maintaining centdians in a fully dynamic forest with top trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479062)