LGP-SA：Graph partition algorithm based on simulated annealing in large-scale graph processing
Distributed computing for large-scale graph data need to partition the graph firstly. The current methods of large-scale graph partitioning is to reduce the edge cut in order to lessen communication overhead by using vertex transfer strategies，but easily to fall into local optimum. Simulated anneali...
محفوظ في:
| المؤلفون الرئيسيون: | , , , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Chinês |
| منشور في: |
Beijing Xintong Media Co., Ltd
2016-02-01
|
| سلاسل: | Dianxin kexue |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.telecomsci.com/thesisDetails#10.3969/j.issn.1000-0801.2016.02.012 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|