Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,732,680 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Algorithm
Binary image
Cluster analysis
Connectivity (graph theory)
Expand
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
H. Popova
Serdica Journal of Computing
2015
Corpus ID: 51861485
We develop a simplified implementation of the Hoshen-Kopelman cluster countingalgorithm adapted for honeycomb networks.In our…
Expand
2009
2009
On the origin of transport non-universality and piezoresistivity in segregated conductor-insulator composites and application to thick-film resistors
N. Johner
2009
Corpus ID: 136520236
In this thesis we address the description of electrical transport properties of disordered conductor-insulator composites, mostly…
Expand
Review
2009
Review
2009
EVALUATION OF OBESITY TREATMENT APPROACHES IN GERIATRIC GROUP FROM ATOXICOLOGICAL ASPECT-II: ANTIOBESITIC DRUGS
P. Erkekoğlu
,
T. Baydar
,
G. Sahin
2009
Corpus ID: 150235331
Hacettepe Üniversitesi Farmasötik Toksikoloji ANKARA ABSTRACT Obesity can be classified as a complex disease which contributes to…
Expand
2009
2009
Performance of a Finite-State Machine Implementation of Iterative Cluster Labeling on Desktop and Mobile Computing Platforms
Matthew Aldridge
,
M. Berry
IEEE Transactions on Knowledge and Data…
2009
Corpus ID: 2872228
In this paper, we present an efficient finite-state machine implementation of the Hoshen-Kopelman cluster identification…
Expand
2008
2008
A Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm
Matthew Lee Aldridge
2008
Corpus ID: 264207840
The purpose of this study was to develop an efficient finite state machine implementation of the eponymous Hoshen-Kopelman…
Expand
2008
2008
A pr 2 00 6 Percolation on Growing Lattices
D. Tiggemann
2008
Corpus ID: 16998514
In order to inverstigate the dependence on lattice size of several observables in percolation, the Hoshen-Kopelman algorithm was…
Expand
2008
2008
A pr 2 00 2 CHAOTIC DYNAMICS OF FOREST FIRES
K. Malarz
,
S. Kaczanowska
,
K. K. lakowski
2008
Corpus ID: 15775884
In the thermodynamic limit, a probabilistic cellular automaton can be approximated by a deterministic nonlinear map. Here we…
Expand
Review
2007
Review
2007
The Role of Communication Channel, Feedback Valence and Cultural Differences in Performance Appraisal Outcomes
James C. Matchen
2007
Corpus ID: 148593834
The effects of feedback valence (positive or negative) across culture (Individualistic or Collectivistic) for both the verbal and…
Expand
2000
2000
A direct parallel implementation of the Hoshen-Kopelman algorithm for distributed memory architectures
J. Teuler
,
J. Gimel
2000
Corpus ID: 62237635
1997
1997
Cluster Counting: the Hoshen-kopelman Algorithm vs. Spanning Tree Approaches
F. Babalievski
1997
Corpus ID: 265096164
Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen-Kopelman…
Expand
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)
ACCEPT & CONTINUE