메뉴 건너뛰기




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)
  • 1
    • 0346215122 scopus 로고
    • eds. G. Deutscher, R. Zallen, J. Adler Adam Hilger, Bristol
    • J. M. Hammersley, Percolation Structures and Processes, eds. G. Deutscher, R. Zallen, J. Adler (Adam Hilger, Bristol, 1983), p. 47.
    • (1983) Percolation Structures and Processes , pp. 47
    • Hammersley, J.M.1
  • 18
    • 0346770907 scopus 로고
    • LANL e-print: cond-mat/9612183
    • C. Dress and W. Krauth, J. Phys. A29, L597 (1995); LANL e-print: cond-mat/9612183.
    • (1995) J. Phys. , vol.A29
    • Dress, C.1    Krauth, W.2
  • 27
    • 0001790593 scopus 로고
    • R. E. Tarjan, SIAM CBMS-NSF Regional Conf. Series in Appl. Math. 44; R. E. Tarjan, SIAM J. Comput. 1, 146 (1972).
    • (1972) SIAM J. Comput. , vol.1 , pp. 146
    • Tarjan, R.E.1
  • 28
    • 0004239687 scopus 로고
    • Widwanictwa Naukowo-techniczne, Warsaw, Rusian Transi: Mir, Moskow ISBN 5-03-000979-5
    • W. Lipski, Kombinatoryka dla Programistow (Widwanictwa Naukowo-techniczne, Warsaw, 1982); (Rusian Transi: Mir, Moskow 1988; ISBN 5-03-000979-5).
    • (1982) Kombinatoryka dla Programistow
    • Lipski, W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.