Design of data structures for mergeable trees

DOI10.1145/1109557.1109602zbMath1192.68177OpenAlexW4235291009MaRDI QIDQ3581569

Renato F. Werneck, Loukas Georgiadis, Robert Endre Tarjan

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109602

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05)

Related Items (1)

Path Minima in Incremental Unrooted Trees

This page was built for publication: Design of data structures for mergeable trees