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 条
  • [1] ANALYSIS OF A CLASS OF GRAPH PARTITIONING PROBLEMS
    BERTOLAZZI, P
    LUCERTINI, M
    SPACCAMELA, AM
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (03): : 255 - 261
  • [2] PARTITIONING FOR VLSI PLACEMENT PROBLEMS.
    Patel, A.M.
    Cote, L.C.
    Proceedings - Design Automation Conference, 1981, : 411 - 418
  • [3] Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
    Dang Phuong Nguyen
    Minoux, Michel
    Viet Hung Nguyen
    Thanh Hai Nguyen
    Sirdey, Renaud
    DISCRETE OPTIMIZATION, 2017, 25 : 175 - 188
  • [4] On the general solution of a class of physical problems.
    Seth, B. R.
    PHILOSOPHICAL MAGAZINE, 1935, 20 (131-37) : 632 - 640
  • [5] Restrictions of graph partition problems. Part I
    Bodlaender, H.L.
    Jansen, K.
    Theoretical Computer Science, 1995, 148 (01):
  • [6] Parameterized Algorithms for Graph Partitioning Problems
    Hadas Shachnai
    Meirav Zehavi
    Theory of Computing Systems, 2017, 61 : 721 - 738
  • [7] Path optimization for graph partitioning problems
    Berry, JW
    Goldberg, MK
    DISCRETE APPLIED MATHEMATICS, 1999, 90 (1-3) : 27 - 50
  • [8] The price of connectedness in graph partitioning problems
    Martin, Nicolas
    Frasca, Paolo
    Ishizaki, Takayuki
    Imura, Jun-Ichi
    Canudas-de-Wit, Carlos
    2019 18TH EUROPEAN CONTROL CONFERENCE (ECC), 2019, : 2313 - 2318
  • [9] EXPECTED COMPLEXITY OF GRAPH PARTITIONING PROBLEMS
    KUCERA, L
    DISCRETE APPLIED MATHEMATICS, 1995, 57 (2-3) : 193 - 212
  • [10] Parameterized Algorithms for Graph Partitioning Problems
    Shachnai, Hadas
    Zehavi, Meirav
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 384 - 395
12345