另一种方法是最大流量
Yet another approach to the Maximum Flow
摘要:
我介绍了一种新的方法来解决最大流问题的一个简单的算法,稍微好一点的运行时间。这种方法是基于排序弧的剩余图上的顶点洞察。对于一个有n个顶点和m条弧的网络,这种新方法的时间复杂度为O(mn^0.5)。类别:算法,图论和最大流
英文摘要:
I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound for a network with n vertices and m arcs. Category: Algorithms, Graph Theory and maximum flows
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。