메뉴 건너뛰기




Volumn 256, Issue 1, 2010, Pages

Mapping the MPM maximum flow algorithm on GPUs

Author keywords

[No Author keywords available]

Indexed keywords

PHYSICS;

EID: 79952411764     PISSN: 17426588     EISSN: 17426596     Source Type: Conference Proceeding    
DOI: 10.1088/1742-6596/256/1/012006     Document Type: Conference Paper
Times cited : (1)

References (18)
  • 3
    • 0032267765 scopus 로고    scopus 로고
    • Proc. ninth annual ACM-SIAM symposium on Discrete algorithms (SODA 98) (San Francisco, California, United States: Society for Industrial and Applied Mathematics)
    • Fleischer L 1998 Faster algorithms for the quickest transshipment problem with zero transit times Proc. ninth annual ACM-SIAM symposium on Discrete algorithms (SODA 98) (San Francisco, California, United States: Society for Industrial and Applied Mathematics) p 147-156
    • (1998) Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times , pp. 147-156
    • Fleischer, L.1
  • 13
    • 77953201288 scopus 로고    scopus 로고
    • IEEE Computer Society Conf. on Computer Vision and Pattern Recognition Workshops (Anchorage, AK: IEEE)
    • Vineet V and Narayanan P J 2008 CUDA cuts: Fast graph cuts on the GPU IEEE Computer Society Conf. on Computer Vision and Pattern Recognition Workshops (Anchorage, AK: IEEE) p 1-8
    • (2008) CUDA Cuts: Fast Graph Cuts on the GPU , pp. 1-8
    • Vineet, V.1    Narayanan, P.J.2


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