Counting lattice animals: A parallel attack
A parallel algorithm for the enumeration of isolated connected clusters on a regular lattice is presented. The algorithm has been implemented on 17 RISC-based workstations to calculate the perimeter polynomials for the plane triangular lattice up to clustersize \(s = 21\). New data for perimeter polynomials \(D_s\) up to \(D_2|_1\), total number of clusters \(g_s\) up to \(g_2|_2\), and coefficients \(b_r\) in the low-density series expansion of the mean cluster size up to \(b_2|_1\) are given.
scientific article; zbMATH DE number 111923