Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper the efficient space virtualisation for Hoshen--Kopelman algorithm is presented. We observe minimal parallel… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2016
2016
Visual Learning of Arithmetic Operations Yedid Hoshen and Shmuel Peleg ­ HUJI A simple Neural Network model is presented for end… Expand
Is this relevant?
2015
2015
a b s t r a c t We discuss two topics that we have encountered in our lattice-Boltzmann simulations of complex fluids: the sizes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper describes preliminary work on a parallel finite state machine implementation of the Hoshen-Kopelman cluster… Expand
  • figure 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We extend the Hoshen–Kopelman (HK) algorithm for cluster labeling to non-lattice environments, where sites are placed at random… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2000
2000
We present a direct (i.e. non iterative) method for identifying the clusters of a cubic lattice on a distributed memory parallel… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Employing highly efficient algorithms for simulating invasion percolation (IP), whose execution time scales as O[Mlog(M)] or… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
1998
1998
  • J. Hoshen
  • Pattern Recognit. Lett.
  • 1998
  • Corpus ID: 29895994
The enhanced Hoshen-Kopelman (EHK) algorithm is introduced for a single pass analysis of spatial clusters in large images. The… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 4
Is this relevant?
1998
1998
Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen–Kopelman… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
In applications such as landscape ecology, computer mod eling is used to assess habitat fragmentation and its ecological… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?