ANALYSIS OF A CLASS OF GRAPH PARTITIONING PROBLEMS.

被引：0
|
作者：
Bertolazzi, P.
Lucertini, M.
Spaccamela, A.Marchetti
机构：
来源：
Proceedings - Annual Allerton Conference on Communication, Control, and Computing | 1980年 / 16卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The partitioning problem of a graph into m subgraphs with size constraint and an objective function given by the sum of links among vertices belonging to different subgraphs, is known and appears in diverse problem areas. This paper presents simple results concerning some particular classes of trees such as chains, cycles, stars and binary trees. Some ideas for further research in the more general graph partitioning problem are presented.
引用
收藏
页码：660 / 667
相关论文
共 50 条
  • [41] MODIFIED DYNAMIC PROGRAMMING ALGORITHM FOR A CERTAIN CLASS OF EXTREMAL PROBLEMS.
    Alekseyev, O.G.
    Alekseyeva, S.M.
    Engineering Cybernetics (English translation of Tekhnicheskaya Kibernetika), 1973, 11 (06): : 897 - 901
  • [42] A simple message passing algorithm for graph partitioning problems
    Onsjo, Mikael
    Tatanabe, Osamu
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 507 - +
  • [43] Approximation algorithms for maximization problems arising in graph partitioning
    Feige, U
    Langberg, M
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 41 (02): : 174 - 211
  • [44] Algorithms for graph partitioning problems by means of eigenspace relaxations
    Tu, CC
    Shieh, CK
    Cheng, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (01) : 86 - 104
  • [45] Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
    Bonnet, Edouard
    Escoffier, Bruno
    Paschos, Vangelis Th
    Tourniaire, Emeric
    ALGORITHMICA, 2015, 71 (03) : 566 - 580
  • [46] Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
    Édouard Bonnet
    Bruno Escoffier
    Vangelis Th. Paschos
    Émeric Tourniaire
    Algorithmica, 2015, 71 : 566 - 580
  • [47] Approximation algorithms for the generalized graph partitioning problems with restrictions
    Liu, JP
    Zhao, C
    Zhou, JL
    Proceedings of the 8th Joint Conference on Information Sciences, Vols 1-3, 2005, : 308 - 311
  • [48] Improved approximation algorithms for maximum graph partitioning problems
    Jager, G
    Srivastav, A
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 10 (02) : 133 - 167
  • [49] Improved Approximation Algorithms for Maximum Graph Partitioning Problems
    Gerold Jäger
    Anand Srivastav
    Journal of Combinatorial Optimization, 2005, 10 : 133 - 167
  • [50] CUTTING PLANE AND BRANCH AND BOUND FOR SOLVING A CLASS OF SCHEDULING PROBLEMS.
    Wolfe, Carvel S.
    1600, (16):
12345