Rapid algorithm for identifying backbones in the two-dimensional percolation model
无序系统与神经网络
2009-10-31 v2
摘要
We present a rapid algorithm for identifying the current-carrying backbone in the percolation model. It applies to general two-dimensional graphs with open boundary conditions. Complemented by 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 Tarjan's depth-first-search algorithm, and uses the memory of the same size as the modified Hoshen-Kopelman algorithm. Comparison with other algorithms for backbone identification is addressed.
引用
@article{arxiv.cond-mat/0012169,
title = {Rapid algorithm for identifying backbones in the two-dimensional percolation model},
author = {Wei-Guo Yin and Ruibao Tao},
journal= {arXiv preprint arXiv:cond-mat/0012169},
year = {2009}
}
备注
5 pages with 5 eps figures. RevTeX 3.1. Clarify the origin of the hull-generating algorithm