A Breakthrough for Balanced Graph Partitioning

被引：0
|
作者：
Rahimian, Fatemeh [1 ]
机构：
[1] SICS Swedish ICT, Kista, Sweden
来源：
ERCIM NEWS | 2014年 / 98期
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Researchers at SICS have invented a new way to partition graphs into a given number of clusters, such that the related information belongs to the same cluster and the number of connections between clusters are minimized. Graph partitioning, a well known NP-Complete problem, has been already thoroughly investigated for small and medium sized graphs, but this distributed algorithm works on very large graphs.
引用
收藏
页码：56 / 56
页数：1
相关论文
共 50 条
  • [31] Partitioning Graphs into Balanced Components
    Krauthgamer, Robert
    Naor, Joseph
    Schwartz, Roy
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 942 - +
  • [32] Partitioning a graph into a cycle and a sparse graph
    Pokrovskiy, Alexey
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [33] Graph Partitioning for Distributed Graph Processing
    Onizuka M.
    Fujimori T.
    Shiokawa H.
    Data Science and Engineering, 2017, 2 (1) : 94 - 105
  • [34] Balanced graph partitions
    Protasova, KD
    MATHEMATICAL NOTES, 2006, 79 (1-2) : 116 - 121
  • [35] Balanced Graph Partitions
    K. D. Protasova
    Mathematical Notes, 2006, 79 : 116 - 121
  • [36] Balanced and 1-balanced graph constructions
    Hobbs, Arthur M.
    Kannan, Lavanya
    Lai, Hong-Jian
    Lai, Hongyuan
    Weng, Guoqing
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (14) : 1511 - 1523
  • [37] BALANCED AND STRONGLY BALANCED FRIENDSHIP GRAPH SYSTEMS
    Huang, Ming-Hway
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2016, 17 (01): : 21 - 28
  • [38] Towards Fast Large-scale Graph Analysis via Two-dimensional Balanced Partitioning
    Lin, Shuai
    Wang, Rui
    Li, Yongkun
    Xu, Yinlong
    Lui, John C. S.
    Chen, Fei
    Wang, Pengcheng
    Han, Lei
    51ST INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2022, 2022,
  • [39] Unbalanced Graph Partitioning
    Angsheng Li
    Peng Zhang
    Theory of Computing Systems, 2013, 53 : 454 - 466
  • [40] Graph Partitioning Methods
    Tanvi, Prabhu Dessai
    Okstynn, Rodrigues
    Sonia, Fernandes
    PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON FRONTIERS IN INTELLIGENT COMPUTING: THEORY AND APPLICATIONS, FICTA 2016, VOL 1, 2017, 515 : 241 - 249
12345