Extension of Hoshen-Kopelman algorithm to non-lattice environments

DOI10.1016/S0378-4371(02)01586-8zbMath1011.82014OpenAlexW2064749788MaRDI QIDQ1867874

Tadeusz W. Patzek, Ahmed Al-Futaisi

Publication date: 2 April 2003

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4371(02)01586-8

zbMATH Keywords

network connectivitycluster labelingrandom site placement

Mathematics Subject Classification ID

Percolation (82B43) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (4)

Non-monotonic wettability effects on displacement in heterogeneous porous media ⋮ Dynamic Pore-Network Models Development ⋮ A minimal agent-based model for the size-frequency distribution of firms ⋮ An algorithm for detecting percolating structures in periodic systems - application to polymer networks

Cites Work

• Unnamed Item
• Cluster size distribution at criticality
• A direct parallel implementation of the Hoshen-Kopelman algorithm for distributed memory architectures
• On the computational power of pushdown automata
• On the application of the enhanced Hoshen–Kopelman algorithm for image analysis
• Exploring complex networks

This page was built for publication: Extension of Hoshen-Kopelman algorithm to non-lattice environments