Cluster Counting: the Hoshen-kopelman Algorithm vs. Spanning Tree Approaches

  • F Babalievski
  • Published 1997

Abstract

Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen-Kopelman multiple labeling technique for cluster statistics is redescribed. Modifications for random and aperiodic lattices are sketched as well as some parallelised versions of the algorithm are mentioned. The graph-theoretical basis for the… (More)

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Babalievski1997ClusterCT, title={Cluster Counting: the Hoshen-kopelman Algorithm vs. Spanning Tree Approaches}, author={F Babalievski}, year={1997} }