Design of data structures for mergeable trees


Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation that merges two tree paths. In contrast to the standard problem, in which only one tree arc at a time changes, a single merge operation can change many arcs. In spite of this, we… (More)


2 Figures and Tables

Cite this paper

@inproceedings{Georgiadis2006DesignOD, title={Design of data structures for mergeable trees}, author={Loukas Georgiadis and Robert E. Tarjan and Renato F. Werneck}, booktitle={SODA}, year={2006} }