ANALYSIS OF A CLASS OF GRAPH PARTITIONING PROBLEMS.

被引:0
|
作者
Bertolazzi, P.
Lucertini, M.
Spaccamela, A.Marchetti
机构
关键词
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 条