Summary of Large-Scale Grapb Partitioning Algoritbms
The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were discussed. Then the advantages and disadvantages of...
Saved in:
Main Authors: | Jinfeng Xu, Yihong Dong, Shiyi Wang, Xianmang He, Huahui Chen |
---|---|
Format: | Article |
Language: | zho |
Published: |
Beijing Xintong Media Co., Ltd
2014-07-01
|
Series: | Dianxin kexue |
Subjects: | |
Online Access: | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.07.016/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
LGP-SA:Graph partition algorithm based on simulated annealing in large-scale graph processing
by: Jinfeng XU, et al.
Published: (2016-02-01) -
Graph partition based mapping algorithm on multiprocessors for streaming applications
by: Qi TANG, et al.
Published: (2016-06-01) -
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01) -
Securely redundant scheduling policy for MapReduce based on dynamic domains partition
by: Qing-ni SHEN, et al.
Published: (2014-01-01) -
A Large Scale Network Traffic Analysis System Design Based on the MapReduce Platform
by: Hong Tang
Published: (2013-12-01)