arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.09678cs.DS
收藏

无标度网络中最大流的高效计算

Efficiently Computing Maximum Flows in Scale-Free Networks

Thomas Bläsius, Tobias Friedrich, Christopher Weyand

摘要:

我们研究无标度网络上的最大流/最小割问题,即,度分布遵循幂律的图。我们提出了一个简单的算法,利用的事实,往往只有一小部分这样的网络是相关的流量。在其核心,我们的算法增强Dinitz的算法与平衡的双向搜索。我们在无标度随机网络模型上的实验表明了次线性运行时间。在无标度的真实世界网络中,我们的性能比常用的最高标签Push-Relabel实现高出两个数量级。与Dinitz的原始算法相比,我们的修改减少了搜索空间,例如,在自治系统图上是275倍。除了这些良好的运行时间,我们的算法有一个额外的优势相比,Push-Relabel。后者计算预流,这使得提取最小切割可能更加困难。例如,这与Gomory-Hu树的计算有关。在具有70000个节点的社交网络上,我们的算法在3秒内计算Gomory-Hu树,而使用Push-Relabel时需要12分钟。

英文摘要:

We study the maximum-flow/minimum-cut problem on scale-free networks, i.e., graphs whose degree distribution follows a power-law. We propose a simple algorithm that capitalizes on the fact that often only a small fraction of such a network is relevant for the flow. At its core, our algorithm augments Dinitz's algorithm with a balanced bidirectional search. Our experiments on a scale-free random network model indicate sublinear run time. On scale-free real-world networks, we outperform the commonly used highest-label Push-Relabel implementation by up to two orders of magnitude. Compared to Dinitz's original algorithm, our modifications reduce the search space, e.g., by a factor of 275 on an autonomous systems graph. Beyond these good run times, our algorithm has an additional advantage compared to Push-Relabel. The latter computes a preflow, which makes the extraction of a minimum cut potentially more difficult. This is relevant, for example, for the computation of Gomory-Hu trees. On a social network with 70000 nodes, our algorithm computes the Gomory-Hu tree in 3 seconds compared to 12 minutes when using Push-Relabel.

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

↑