Divide-and-conquer minimal-cut bisectioning of task graphs

被引：0
|
作者：
Lor, S
Shen, H
Maheshwari, P
机构：
来源：
COMPUTER SYSTEMS SCIENCE AND ENGINEERING | 1996年 / 11卷 / 04期
关键词：
combinatorial problems; graph partitioning; heuristic algorithms; mapping problem; parallel processing;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes a method for partitioning the vertex set of an undirected simple weighted graph into two subsets so as to minimise the difference of vertex-weight sums between the two subsets and the total weight of the edges cut (i.e. edges with one end in each subset). The proposed heuristic algorithm works in a divide-and-conquer fashion and is a modification of an algorithm suggested in the literature. The algorithm has the same time complexity as the previous one but is extended to work on weighted graphs.
引用
收藏
页码：227 / 234
页数：8
相关论文
共 50 条
  • [21] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [22] A DIVIDE-AND-CONQUER ALGORITHM FOR THE AUTOMATIC LAYOUT OF LARGE DIRECTED-GRAPHS
    MESSINGER, EB
    ROWE, LA
    HENRY, RR
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (01): : 1 - 12
  • [23] PRUNING DIVIDE-AND-CONQUER NETWORKS
    ROMANIUK, SG
    NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1993, 4 (04) : 481 - 494
  • [24] DIVIDE-AND-CONQUER NEURAL NETWORKS
    ROMANIUK, SG
    HALL, LO
    NEURAL NETWORKS, 1993, 6 (08) : 1105 - 1116
  • [25] CUTTING HYPERPLANES FOR DIVIDE-AND-CONQUER
    CHAZELLE, B
    DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (02) : 145 - 158
  • [26] Minimal-cut model composition
    Hassner, T
    Zelnik-Manor, L
    Leifman, G
    Basri, R
    INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDINGS, 2005, : 72 - 81
  • [27] AVERAGE COMPLEXITY OF DIVIDE-AND-CONQUER ALGORITHMS
    VEROY, BS
    INFORMATION PROCESSING LETTERS, 1988, 29 (06) : 319 - 326
  • [28] Speaker Diarization Using Divide-and-Conquer
    Cheng, Shih-Sian
    Tseng, Chun-Han
    Chen, Chia-Ping
    Wang, Hsin-Min
    INTERSPEECH 2009: 10TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION 2009, VOLS 1-5, 2009, : 1059 - +
  • [29] Divide-and-Conquer With Sequential Monte Carlo
    Lindsten, F.
    Johansen, A. M.
    Naesseth, C. A.
    Kirkpatrick, B.
    Schon, T. B.
    Aston, J. A. D.
    Bouchard-Cote, A.
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2017, 26 (02) : 445 - 458
  • [30] SOLUTION OF A DIVIDE-AND-CONQUER MAXIMIN RECURRENCE
    LI, Z
    REINGOLD, EM
    SIAM JOURNAL ON COMPUTING, 1989, 18 (06) : 1188 - 1200
12345