重图的$f$ -因子的阻塞迹
Blocking Trails for $f$-factors of Multigraphs
摘要:
Dinic [2]为网络流引入的阻塞流已经被用于加速许多增加路径类型的算法,特别是匹配算法,例如,[18,23,16]。给出了一般多重图f-因子的阻塞跟踪的$O(m)$时间算法。这将以前的算法改进了$α(m,n)$倍。这加速了用于f因子的许多有效算法,例如,用于最大权重f匹配的[11]的算法通过上述$α(m,n)$因子改进了用于最大边权重的$Φ=\sum _{v\in V} f(v)$、$W$的运行时间$O( \sqrt {Φ\log Φ} m \log (ΦW) )$。这个时间界限在二分多重图的界限的因子$\sqrt {\log Φ}$内。这项工作的技术困难源于这样一个事实,即以前的算法匹配和$f$匹配使用顶点收缩形成花朵,但我们的DFS为基础的方法需要使用边缘收缩。作为一个例子的困难,边缘收缩介绍了一种新的形式的花朵,我们称之为“斜花”。这些是必须重组以成为有效花的配置。
英文摘要:
Blocking flows, introduced by Dinic [2] for network flow, have been used to speed up many augmenting-path type algorithms, especially matching algorithms e.g., [18, 23, 16]. We present an $O(m)$ time algorithm for blocking trails for f-factors of general multigraphs. This improves a previous algorithm by a factor of $α(m,n)$. This speeds up a number of efficient algorithms for f-factors, e.g., the algorithm of [11] for maximum weight f-matching improves by the aforementioned $α(m,n)$ factor to running time $O( \sqrt {Φ\log Φ} m \log (ΦW) )$ for $Φ=\sum _{v\in V} f(v)$, $W$ the maximum edge weight. This time bound is within a factor $\sqrt {\log Φ}$ of the bound for bipartite multigraphs. The technical difficulty for this work stems from the fact that previous algorithms for both matching and $f$-matching use vertex contractions to form blossoms, but our dfs-based approach necessitates using edge contractions. As an example difficulty, edge contractions introduce a new form of blossoms we call "skew blossoms". These are configurations that must be reorganized in order to become valid blossoms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。