论文标题
切开一些加权图的边界
Cut Bounds for Some Weighted Graphs
论文作者
论文摘要
在通信字段中，一个重要的问题是将用户和基站分组，以使尽可能多的子网满足某些干扰约束。这些问题通常是作为图形分区问题提出的，可以最大程度地减少某些形式的图形切割。先前的研究已经对未加权的常规图的切割界限产生了一些结果。在本文中，我们证明了具有一些规则属性的加权图的下限结果，并且对于更一般的情况显示了相似的结果。
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which minimize some forms of graph cut. Previous research already gave some results about the cut bounds for unweighted regular graph. In this paper, we prove a result about the lower bound for weighted graphs that have some regular properties and show similar results for more general case.
