arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.1269math.CO
收藏

匈牙利法和Hall定理的推广及其在无线传感器网络中的应用

A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks

D. Bokal, B. Bresar, J. Jerebic

摘要:

本文研究了二部图中的拟匹配和半匹配问题,推广了经典的判定二部图中完美匹配的问题。我们证明了霍尔婚姻定理的一个广泛推广,并提出了一个算法,解决了确定字典最小$g$ -准匹配的问题(即二分图中的边的集合$F$,使得在二分图的一个集合中每个顶点$v$具有来自$F$的至少$g(v)$关联边,其中$g$是所谓的需要映射,而在二分区的另一侧,相对于$F$的度的分布在字典上是最小的)。我们还提出了一个应用程序在设计一个最佳的基于CDMA的无线传感器网络。

英文摘要:

In this paper, we consider various problems concerning quasi-matchings and semi-matchings in bipartite graphs, which generalize the classical problem of determining a perfect matching in bipartite graphs. We prove a vast generalization of Hall's marriage theorem, and present an algorithm that solves the problem of determining a lexicographically minimum $g$-quasi-matching (that is a set $F$ of edges in a bipartite graph such that in one set of the bipartition every vertex $v$ has at least $g(v)$ incident edges from $F$, where $g$ is a so-called need mapping, while on the other side of the bipartition the distribution of degrees with respect to $F$ is lexicographically minimum). We also present an application in designing an optimal CDMA-based wireless sensor networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑