Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Hoshen–Kopelman algorithm
open-in-new
<p>The Hoshen–Kopelman algorithm is a simple and efficient <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> for labeling <a href="/facts/Cluster_analysis/HUeDnWPt">clusters</a> on a grid, where the grid is a regular <a href="/facts/Network_theory/m6CQovwm">network</a> of cells, with the cells being either occupied or unoccupied. This algorithm is based on a well-known <a href="/facts/Disjoint-set_data_structure/QnFQNedE">union-finding algorithm</a>. The algorithm was originally described by Joseph Hoshen and <a href="/facts/Raoul_Kopelman/DRcLCJqo">Raoul Kopelman</a> in their 1976 paper "Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm". </p>