메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Crunching large graphs with commodity processors

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS;

EID: 84874175020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (36)
  • 4
    • 34547399946 scopus 로고    scopus 로고
    • Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2
    • aug
    • David A. Bader and Kamesh Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In International Conference on Parallel Procesing, aug. 2006.
    • (2006) International Conference on Parallel Procesing
    • Bader, David A.1    Madduri, Kamesh2
  • 22
    • 84924178998 scopus 로고    scopus 로고
    • Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
    • Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6, 2009.
    • (2009) Internet Mathematics , vol.6
    • Leskovec, Jure1    Lang, Kevin J.2    Dasgupta, Anirban3    Mahoney, Michael W.4
  • 31
    • 85092801203 scopus 로고    scopus 로고
    • Mellanox Technologies
    • Mellanox Technologies. Infiniband switch systems, 2011. http://www.mellanox.com.
    • (2011) Infiniband switch systems


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