메뉴 건너뛰기
Social Networks
Volumn 23, Issue 3, 2001, Pages 237-243
A subquadratic triad census algorithm for large sparse networks with small maximum degree
Author keywords

05C85; 05C90; 68R10; 68W40; 91D30; 93A15; Algorithm; Large networks; Triad census
Indexed keywords

EID: 0042761753     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-8733(01)00035-1     Document Type: Article
Times cited : (99)
References (4)
  • 1
    • 18744421488 scopus 로고    scopus 로고
    • Mean-field theory for scale-free random networks
    • Barabasi A-L., Reka A., Hawoong J. Mean-field theory for scale-free random networks. Physica A. 272:1999;173-187.
    • (1999) Physica a , vol.272 , pp. 173-187
    • Barabasi, A.-L.1    Reka, A.2    Hawoong, J.3
  • 2
    • 0002226683 scopus 로고    scopus 로고
    • Pajek - A program for large network analysis
    • Batagelj V., Mrvar A. Pajek - a program for large network analysis. Connections. 21(2):1998;47-57.
    • (1998) Connections , vol.21 , Issue.2 , pp. 47-57
    • Batagelj, V.1    Mrvar, A.2
  • 4
    • 0040688999 scopus 로고    scopus 로고
    • Matrix methods for calculating the triad census
    • Moody J. Matrix methods for calculating the triad census. Social Networks. 20:1998;291-299.
    • (1998) Social Networks , vol.20 , pp. 291-299
    • Moody, J.1

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