Skip to search formSkip to main contentSkip to account menu

Hoshen–Kopelman algorithm

Known as: Hoshen-Kopelman Algorithm 
The Hoshen–Kopelman algorithm is a simple and efficient algorithm for labeling clusters on a grid. Where the grid is a regular network of cells, with… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
AlgorithmBinary imageCluster analysisConnectivity (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks
We develop a simplified implementation of the Hoshen-Kopelman cluster countingalgorithm adapted for honeycomb networks.In our… 
2009
2009
On the origin of transport non-universality and piezoresistivity in segregated conductor-insulator composites and application to thick-film resistors
In this thesis we address the description of electrical transport properties of disordered conductor-insulator composites, mostly… 
Review
2009
Review
2009
EVALUATION OF OBESITY TREATMENT APPROACHES IN GERIATRIC GROUP FROM ATOXICOLOGICAL ASPECT-II: ANTIOBESITIC DRUGS
Hacettepe Üniversitesi Farmasötik Toksikoloji ANKARA ABSTRACT Obesity can be classified as a complex disease which contributes to… 
2009
2009
Performance of a Finite-State Machine Implementation of Iterative Cluster Labeling on Desktop and Mobile Computing Platforms
In this paper, we present an efficient finite-state machine implementation of the Hoshen-Kopelman cluster identification… 
2008
2008
A Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm
The purpose of this study was to develop an efficient finite state machine implementation of the eponymous Hoshen-Kopelman… 
2008
2008
A pr 2 00 6 Percolation on Growing Lattices
In order to inverstigate the dependence on lattice size of several observables in percolation, the Hoshen-Kopelman algorithm was… 
2008
2008
A pr 2 00 2 CHAOTIC DYNAMICS OF FOREST FIRES
In the thermodynamic limit, a probabilistic cellular automaton can be approximated by a deterministic nonlinear map. Here we… 
Review
2007
Review
2007
The Role of Communication Channel, Feedback Valence and Cultural Differences in Performance Appraisal Outcomes
The effects of feedback valence (positive or negative) across culture (Individualistic or Collectivistic) for both the verbal and… 
2000
2000
A direct parallel implementation of the Hoshen-Kopelman algorithm for distributed memory architectures
1997
1997
Cluster Counting: the Hoshen-kopelman Algorithm vs. Spanning Tree Approaches
Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen-Kopelman… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)