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...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Chinês |
| Udgivet: |
Beijing Xintong Media Co., Ltd
2016-02-01
|
| Serier: | Dianxin kexue |
| Fag: | |
| Online adgang: | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2016.02.012/ |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
