|
Volumn 9, Issue 1, 1998, Pages 43-60
|
Cluster counting: The Hoshen-Kopelman algorithm versus spanning tree approaches
|
Author keywords
Graph Theoretical; Parallel Computing; Percolation
|
Indexed keywords
|
EID: 0032376266
PISSN: 01291831
EISSN: None
Source Type: Journal
DOI: 10.1142/S0129183198000054 Document Type: Article |
Times cited : (39)
|
References (35)
|