Summary of Large-Scale Graph Partitioning Algorithms

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

Full description

Saved in:
Bibliographic Details
Published inDianxin Kexue Vol. 30; no. 7; pp. 100 - 106
Main Authors Xu, Jinfeng, Dong, Yihong, Wang, Shiyi, He, Xianmang, Chen, Huahui
Format Journal Article
LanguageChinese
Published 01.07.2014
Subjects
Algorithms
Computation
Dynamics
Graphs
Mathematical models
Partitioning
Partitions
Telecommunications
Online AccessGet full text
ISSN1000-0801
DOI10.3969/j.issn.1000-0801.2014.07.016

Cover

More Information
Summary: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 these algorithms and its adaptability conscientiously were sumed up. Finally, some meaningful research subjects about the distributed graph partition, which have not been explored were pointed out.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1000-0801
DOI:10.3969/j.issn.1000-0801.2014.07.016