I/O-efficient batched union-find and its applications to terrain analysis

DOI10.1145/1868237.1868249zbMath1295.68104OpenAlexW2046183524MaRDI QIDQ3188993

Ke Yi, Lars Arge, Pankaj K. Agarwal

Publication date: 9 September 2014

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

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

zbMATH Keywords

union-findI/O-efficient algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items

An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications ⋮ Removing local extrema from imprecise terrains

This page was built for publication: I/O-efficient batched union-find and its applications to terrain analysis