Cluster Counting: The Hoshen–Kopelman Algorithm Versus Spanning Tree Approaches

F. Babalievski ()
Additional contact information
F. Babalievski: Institute for Computer Applications 1, University of Stuttgart, Stuttgart, 70569, Germany

International Journal of Modern Physics C (IJMPC), 1998, vol. 09, issue 01, 43-60

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 parallelized versions of the algorithm are mentioned. The graph-theoretical basis for the spanning tree approaches is given by describing thebreadth first searchanddepth first searchprocedures. Examples are given for extracting the elastic and geometric "backbone" of a percolation cluster. An implementation of the "pebble game" algorithm using a depth first search method is also described.

Keywords: Graph-Theoretical; Percolation; Parallel Computing (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183198000054
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:09:y:1998:i:01:n:s0129183198000054

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183198000054

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().