Hybrid cluster identification

Journal of Physics A: Mathematical and General

Volumn 37, Issue 40, 2004, Pages 9377-9386

  Martin Herrero J ^a  

^a UNIVERSITY OF VIGO   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 6344243260     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/37/40/004     Document Type: Article

References (29)

1. Al-Futaisi A and Patzek T W 2003 Extension of Hoshen-Kopelman algorithm to non-lattice environments Physica A 321 665
2. Alnuweiri H M and Prasanna V K 1992 Parallel architectures and algorithms for image component labelling IEEE Trans. Pattern Anal. Mach. Intell. 14 1014
3. Babalievski F 1998 Cluster counting: the Hoshen-Kopelman algorithm vs. spanning tree approaches Int. J. Mod. Phys. C 9 43
4. Constantin J M, Berry M W and Van der Zanden B T 1997 Parallelization of the Hoshen-Kopelman algorithm using a finite state machine Int. J. Supercomput. Appl. High Perf. Comput. 11 34
5. Flanigan M and Tamayo P 1995 Parallel cluster labelling for large-scale Monte Carlo simulations Physica A 215 461
6. Galler A B and Fischer M J 1964 An improved equivalence algorithm Commun. ACM 7 301
7. Grimmet G 1987 Interacting particle systems and random media: an overview Int. Stat. Rev. 55 49
8. Hoshen J and Kopelman R 1976 Percolation and cluster distribution: cluster multiple labelling technique and critical concentration algorithm Phys. Rev. B 14 3438
9. Ising E 1925 Beitrag zur theorie des ferromagnetismus Z. Phys. 31 253 (English translation available at http://www.fh-augsburg.de/~harsch/anglica/ Chronology/20thC/Ising/isi_fm00.html)
10. Leath P L 1976 Cluster size and boundary distribution near percolation threshold Phys. Rev. B 14 5046
11. Martín-Herrero J and Peón-Fernández J 2000 Alternative techniques for cluster labelling on percolation theory J. Phys. A: Math. Gen. 33 1827
12. Moloney N R and Pruessner G 2003 Asynchronously parallelized percolation on distributed machines Phys. Rev. E 67 37701
13. Moukarzel C 1998 A fast algorithm for backbones Int. J. Mod. Phys. C 9 887
14. Newman M E J and Ziff R M 2001 A fast Monte Carlo algorithm for site or bond percolation Phys. Rev. E 64 16706
15. Paul G, Ziff R M and Stanley H E 2001 Percolation threshold, fisher exponent, and shortest path exponent for 4 and 5 dimensions Phys. Rev. E 64 26115
16. Potts R B 1952 Some generalized order-disorder transformations Proc. Camb. Phil. Soc. 48 106
17. Rappaport D C 1986 Cluster number scaling in two-dimensional percolation J. Phys. A: Math. Gen. 19 291
18. Rosenfeld A and Pfaltz J 1966 Sequential operations in digital picture processing J. Assoc. Comput. Mach. 13 471
19. Sheppard A P, Knackstedt M A, Pinczewski W V and Sahimi M 1999 Invasion percolation: new algorithms and universality classes J. Phys. A: Math. Gen. 32 L521
20. Stauffer D and Aharony A 1994 Introduction to Percolation Theory (London: Taylor and Francis)
21. Swendsen R and Wang J 1987 Nonuniversal critical dynamics in Monte Carlo simulations Phys. Rev. Lett. 58 86
22. Tarjan R E 1972 Depth-first search and linear graph algorithms SIAM J. Comput. 1 146
23. Tarjan R E 1975 Efficiency of a good but not linear set union algorithm J. Assoc. Comput. Mach. 22 215
24. Teuler J M and Gimel J C 2000 A direct parallel implementation of the Hoshen-Kopelman algorithm for distributed memory architectures Comput. Phys. Commun. 130 118
25. Tiggemann D 2001 Simulation of percolation on massively-parallel computers Int. J. Mod. Phys. C 12 871
26. Wang J 2002 http://www.cz3.nus.edu.sg/~wangjs/Bworkshop/sw-oner-gg.c
27. Wolff U 1989 Collective Monte Carlo updating for spin systems Phys. Rev. Lett. 62 361
28. Wu F Y 1982 The Potts model Rev. Mod. Phys. 54 235
29. Ziff R M, Cummings P T and Stell G 1984 Generation of percolation cluster perimeters by a random walk J. Phys. A: Math. Gen. 17 3009