메뉴 건너뛰기




Volumn 4, Issue 2, 2000, Pages 1-11

Approximation algorithms for some graph partitioning problems

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MANUFACTURE;

EID: 4043178261     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00021     Document Type: Article
Times cited : (19)

References (10)
  • 3
    • 0034370176 scopus 로고    scopus 로고
    • An Application of Multi-Dimensional Matching to Logistics
    • J. Exoo, J. Jiang and C. Zhao, An Application of Multi-Dimensional Matching to Logistics, Utilitas Mathematica 57(2000), pp. 227-235.
    • (2000) Utilitas Mathematica , vol.57 , pp. 227-235
    • Exoo, J.1    Jiang, J.2    Zhao, C.3
  • 4
    • 0026823950 scopus 로고
    • Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers
    • M. Gupta and P. Banerjee, Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers, IEEE Transactions on Parallel and Distributed Systems, No. 2, 3 (1992), pp. 179-193.
    • (1992) IEEE Transactions on Parallel and Distributed Systems, No. 2 , vol.3 , pp. 179-193
    • Gupta, M.1    Banerjee, P.2
  • 5
    • 0025381427 scopus 로고
    • Data Optimization, Allocation of Arrays to Reduce Communication in SIMD Machines
    • K. Knoble, J. Lukas and G. L. Steele, Data Optimization, Allocation of Arrays to Reduce Communication in SIMD Machines, Journal of Parallel and Distributed Computing, 8 (1990), pp., 102-118.
    • (1990) Journal of Parallel and Distributed Computing , vol.8 , pp. 102-118
    • Knoble, K.1    Lukas, J.2    Steele, G.L.3


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