51 search results - page 11 / 11 » Constructive Upper Bounds for Cycle-Saturated Graphs of Mini... |
COMPGEOM
2006
ACM
13 years 8 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...