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

强连通网络中的可行流

Finding a Feasible Flow in a Strongly Connected Network

Bernhard Haeupler, Robert E. Tarjan

摘要:

研究了在强连通网络中,当供给和需求相等且最小弧容量至少等于需求和时,求一个单商品流的问题.一个快速算法,这个问题的改进Goldberg-Rao最大流方法的最坏情况下的时间界的一个常数因子。Erlebach和Hagerup给出了线性时间可行流算法。我们给出一个可以说是更简单的。

英文摘要:

We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method by a constant factor. Erlebach and Hagerup gave an linear-time feasible flow algorithm. We give an arguably simpler one.

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

↑