Efficient Union-Find for Planar Graphs and other Sparse Graph Classes.

Jens Gustedt Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. 123-141 1998 203 Theor. Comput. Sci. 1 db/journals/tcs/tcs203.html#Gustedt98 http://dx.doi.org/10.1016/S0304-3975(97)00291-0