LGP-SA：Graph partition algorithm based on simulated annealing in large-scale graph processing

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Jinfeng XU, Yihong DONG, Shiyi WANG, Xianmang HE, Huahui CHEN
Format: Article
Language:zho
Published: Beijing Xintong Media Co., Ltd 2016-02-01
Series:Dianxin kexue
Subjects:
graph partition
Giraph
simulated annealing
large-scale graph
BSP
Online Access:http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2016.02.012/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2016.02.012/

Similar Items