Rapid algorithm for identifying backbones in the two-dimensional percolation model

Details Rapid algorithm for identifying backbones in the two-dimensional percolation model Rapid algorithm for identifying backbones in the two-dimensional percolation model

2000-12-11

arxiv.org/abs/cond-mat/0012169v2

International Journal of Modern Physics C: Physics and Computers 14, 1427 (2003)

Physics

Condensed Matter

Disordered Systems and Neural Networks

5 pages with 5 eps figures. RevTeX 3.1. Clarify the origin of the hull-generating algorithm

Scientific paper

10.1142/S0129183103005509

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.

Affiliated with

Also associated with

No associations

Rating

Rapid algorithm for identifying backbones in the two-dimensional percolation model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rapid algorithm for identifying backbones in the two-dimensional percolation model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rapid algorithm for identifying backbones in the two-dimensional percolation model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149143