Rapid algorithm for identifying backbones in the two-dimensional percolation model
We present a rapid algorithm for identifying the current-carrying backbone in the two-dimensional percolation model. Taking advantage of the modified Hoshen-Kopelman cluster labeling algorithm, our algorithm identifies dangling parts using their local properties. For planar graphs, it finds the backbone almost four times as fast as the commonly-used Tarjan's depth-first-search algorithm. Comparison with other algorithms for backbone identification is also addressed.
rapid algorithm percolation models backbone identification critical exponents