Year: 2004
Type: article
Abstract: Diffusion-limited aggregation (DLA) is studied from the perspective of computational complexity. A parallel algorithm is exhibited that requires a number of steps that scales as the depth of the tree defined by the cluster. The existence of this algorithm suggests a connection between a fundamental computational and structural property of DLA.
Source: Physical Review E
Authors: D. Tillberg, J. Machta
Institution: University of Massachusetts Amherst
Language: English
Subfield: Condensed Matter Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2082902534