Data structures for mergeable trees

DOI10.1145/1921659.1921660zbMath1295.68101arXiv0711.1682OpenAlexW1973784010MaRDI QIDQ3188996

Haim Kaplan, Renato F. Werneck, Loukas Georgiadis, Nira Shafrir, Robert Endre Tarjan

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.1682

zbMATH Keywords

manifoldsextreme pointscritical pairscomputational topologymergingdynamic treesamortized efficiencylink-cut trees

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

Revisiting graph persistence for updates and efficiency ⋮ Path Minima in Incremental Unrooted Trees

This page was built for publication: Data structures for mergeable trees