arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.01102cs.DS
收藏

重图的$f$ -因子的权标算法

A Weight-scaling Algorithm for $f$-factors of Multigraphs

Harold Gabow

摘要:

我们讨论的组合算法找到一个最大的重量$f$ -因子的任意多重图,给定的整数权重的幅度最多$W$。对于简单二部图,最著名的时间界是$O(n^{2/3}\, m\, \log nW)$(\cite{GT89} ; $n$和$m$分别是顶点和边的数目)。Duan和He等人最近的一个算法\cite{DHZ} for $f$ -factors of simple graphs在这个界的对数因子之内,$\widetilde{O} (n^{2/3}\, m\, \log W)$。二部多重图最著名的界是$O(\sqrt Φ\, m\, \log ΦW)$($Φ\le m$是$f$ -因子的大小,$Φ=\sum_{v\in V}f(v)/2$)。这个界限比对简单图的限制更一般,并且在“小”简单图上甚至更优越,即,$Φ=o(n^{4/3})$。我们提出了一种算法,该算法在该界限的$\sqrt {\log Φ}$因子内,即,$O(\sqrt {Φ\log Φ}\,m \,\log ΦW)$。该算法是Gabow和Tarjan的\cite{GT}算法在普通匹配的特殊情况下($f\equiv 1$)的直接推广。我们提出我们的算法首先为普通匹配,分析是一个简化版本的\cite{GT}。此外,该算法和分析都得到合并,而无需修改的多重图算法。为了将这些想法扩展到$f$ -因子,第一步是“扩展”边(即,用长度3的交替路径代替边缘)。\cite{DHZ}使用整个图的一次性扩展。我们的算法通过只扩展选定的边来保持图的小,并在不再需要时将它们“压缩”回原始源。还需要其他一些想法,包括将“开花”的概念放宽为电子开花(“扩大开花”)。

英文摘要:

We discuss combinatorial algorithms for finding a maximum weight $f$-factor on an arbitrary multigraph, for given integral weights of magnitude at most $W$. For simple bipartite graphs the best-known time bound is $O(n^{2/3}\, m\, \log nW)$ (\cite{GT89}; $n$ and $m$ are respectively the number of vertices and edges). A recent algorithm of Duan and He et al. \cite{DHZ} for $f$-factors of simple graphs comes within logarithmic factors of this bound, $\widetilde{O} (n^{2/3}\, m\, \log W)$. The best-known bound for bipartite multigraphs is $O(\sqrt Φ\, m\, \log ΦW)$ ($Φ\le m$ is the size of the $f$-factor, $Φ=\sum_{v\in V}f(v)/2$). This bound is more general than the restriction to simple graphs, and is even superior on "small" simple graphs, i.e., $Φ=o(n^{4/3})$. We present an algorithm that comes within a $\sqrt {\log Φ}$ factor of this bound, i.e., $O(\sqrt {Φ\log Φ}\,m \,\log ΦW)$. The algorithm is a direct generalization of the algorithm of Gabow and Tarjan \cite{GT} for the special case of ordinary matching ($f\equiv 1$). We present our algorithm first for ordinary matching, as the analysis is a simplified version of \cite{GT}. Furthermore the algorithm and analysis both get incorporated without modification into the multigraph algorithm. To extend these ideas to $f$-factors, the first step is "expanding" edges (i.e., replacing an edge by a length 3 alternating path). \cite{DHZ} uses a one-time expansion of the entire graph. Our algorithm keeps the graph small by only expanding selected edges, and "compressing" them back to their original source when no longer needed. Several other ideas are needed, including a relaxation of the notion of "blossom" to e-blossom ("expanded blossom").

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

↑