A MULTIGRID CLUSTER LABELING SCHEME

We introduce a simple multi-scale algorithm for connected component labeling on parallel computers, which we apply to the problem of labeling clusters in spin and percolation models. We give numerical evidence that it is only logarithmically slowed down in the critical limit. We also discuss, in light of the proposed Teraflop computers optimized for lattice gauge theories and other lattice problems, the minimum requirements for computer switchboard architectures for which one can efficiently implement such multi-scale algorithms.