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 条
  • [1] Balanced Graph Partitioning
    Konstantin Andreev
    Harald Racke
    Theory of Computing Systems, 2006, 39 : 929 - 939
  • [2] Balanced graph partitioning
    Andreev, Konstantin
    Raecke, Harald
    THEORY OF COMPUTING SYSTEMS, 2006, 39 (06) : 929 - 939
  • [3] DYNAMIC BALANCED GRAPH PARTITIONING
    Avin, Chen
    Bienkowski, Marcin
    Loukas, Andreas
    Pacut, Maciej
    Schmid, Stefan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (03) : 1791 - 1812
  • [4] From balanced graph partitioning to balanced Metric Labeling
    Naor, J
    ALGORITHMS - ESA 2005, 2005, 3669 : 9 - 9
  • [5] Doubly Balanced Connected Graph Partitioning
    Soltan, Saleh
    Yannakakis, Mihalis
    Zussman, Gil
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1939 - 1950
  • [6] Optimal Online Balanced Graph Partitioning
    Pacut, Maciej
    Parham, Mahmoud
    Schmid, Stefan
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
  • [7] Balanced Graph Partitioning with Apache Spark
    Carlini, Emanuele
    Dazzi, Patrizio
    Esposito, Andrea
    Lulli, Alessandro
    Ricci, Laura
    EURO-PAR 2014: PARALLEL PROCESSING WORKSHOPS, PT I, 2014, 8805 : 129 - 140
  • [8] Doubly Balanced Connected Graph Partitioning
    Soltan, Saleh
    Yannakakis, Mihalis
    Zussman, Gil
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
  • [9] Approximate Dynamic Balanced Graph Partitioning
    Raecke, Harald
    Schmid, Stefan
    Zabrodin, Ruslan
    PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 401 - 409
  • [10] Prioritized Restreaming Algorithms for Balanced Graph Partitioning
    Awadelkarim, Amel
    Ugander, Johan
    KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, : 1877 - 1887
12345