一类赋权图的割界
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
