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 条
  • [41] Divide-and-conquer Tournament on Social Networks
    Wang, Jiasheng
    Zhang, Yichao
    Guan, Jihong
    Zhou, Shuigeng
    SCIENTIFIC REPORTS, 2017, 7
  • [42] A DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD
    GU, M
    EISENSTAT, SC
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 79 - 92
  • [43] Divide-and-Conquer for Voronoi Diagrams Revisited
    Aichholzer, Oswin
    Aigner, Wolfgang
    Aurenhammer, Franz
    Hackl, Thomas
    Juettler, Bert
    Pilgerstorfer, Elisabeth
    Rabl, Margot
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 189 - 197
  • [44] Recommendation for Newborn Services by Divide-and-Conquer
    Zhang, Junqi
    Fan, Yushun
    Tan, Wei
    Zhang, Jia
    2017 IEEE 24TH INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS 2017), 2017, : 57 - 64
  • [45] APPROXIMATIONS AND OPTIMAL GEOMETRIC DIVIDE-AND-CONQUER
    MATOUSEK, J
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (02) : 203 - 208
  • [46] Divide-and-Conquer Strategies for Process Mining
    Carmona, Josep
    Cortadella, Jordi
    Kishinevsky, Michael
    BUSINESS PROCESS MANAGEMENT, PROCEEDINGS, 2009, 5701 : 327 - +
  • [47] Divide-and-conquer Jigsaw Puzzle Solving
    Shih, Huang-Chia
    Lu, Chien-Liang
    2018 IEEE INTERNATIONAL CONFERENCE ON VISUAL COMMUNICATIONS AND IMAGE PROCESSING (IEEE VCIP), 2018,
  • [48] Action Recognition Based on Divide-and-Conquer
    Tan, Guanghua
    Miao, Rui
    Xiao, Yi
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2019: IMAGE PROCESSING, PT III, 2019, 11729 : 157 - 167
  • [49] Autotuning divide-and-conquer stencil computations
    Natarajan, Ekanathan Palamadai
    Dehnavi, Maryam Mehri
    Leiserson, Charles
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (17):
  • [50] Divide-and-conquer recurrences - Classification of asymptotics
    Derfel G.
    Vogl F.
    aequationes mathematicae, 2000, 60 (3) : 243 - 257
12345