Journal of Statistical Physics, Vol. 58, Nos. 5/6, 1990. p. 1095-1108.
A fast computer algorithm for enumerating isolated connected clusters on a regular lattice and its Fortran implementation are presented. New perimeter polynomials are calculated for the square, the triangular, the simple cubic, and the square lattice with next nearest neighbors.