一般图的加权$f$ -因子的一个缩放算法
A Scaling Algorithm for Weighted $f$-Factors in General Graphs
摘要:
本文研究了一般简单图$G=(V,E,w)$的最大权完美$f$ -因子问题,其边权为正整数$w$,$n=|V|$,$m=|E|$ .当我们在顶点上有一个函数$f:V\rightarrow \mathbb{N}_+$时,完美的$f$ -因子是一个广义匹配,使得每个顶点$u$与$f(u)$不同的边匹配。以前关于这个问题的最佳算法具有运行时间$O(m f(V))$ [Gabow 2018]或$\tilde{O}(W(f(V))^{2.373}))$ [Gabow和Sankowski 2013],其中$W$是最大边权重,以及$f(V)=\sum_{u\in V}f(u)$。在本文中,我们提出了一个缩放算法,这个问题的运行时间$\tilde{O}(mn^{2/3}\log W)$。以前这个界限只知道二分图[Gabow and Tarjan 1989]。我们的算法的运行时间是独立的$f(V)$,因此,它首先打破了$Ω(mn)$障碍,大$f(V)$,甚至在一般的图中的未加权$f$ -因子问题。
英文摘要:
We study the maximum weight perfect $f$-factor problem on any general simple graph $G=(V,E,w)$ with positive integral edge weights $w$, and $n=|V|$, $m=|E|$. When we have a function $f:V\rightarrow \mathbb{N}_+$ on vertices, a perfect $f$-factor is a generalized matching so that every vertex $u$ is matched to $f(u)$ different edges. The previous best algorithms on this problem have running time $O(m f(V))$ [Gabow 2018] or $\tilde{O}(W(f(V))^{2.373}))$ [Gabow and Sankowski 2013], where $W$ is the maximum edge weight, and $f(V)=\sum_{u\in V}f(u)$. In this paper, we present a scaling algorithm for this problem with running time $\tilde{O}(mn^{2/3}\log W)$. Previously this bound is only known for bipartite graphs [Gabow and Tarjan 1989]. The running time of our algorithm is independent of $f(V)$, and consequently it first breaks the $Ω(mn)$ barrier for large $f(V)$ even for the unweighted $f$-factor problem in general graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。