奇最小割集与b-匹配
Odd minimum cut sets and b-matchings revisited
摘要：
著名的Padberg-Rao分离算法在无容量限制的情况下可以在O（n^2m log（n^2/m））时间内实现，而在有容量限制的情况下可以在O（nm^2 log（n^2/m））时间内实现（其中n是底层图的顶点数，m是底层图的边数）。我们给出了一个新的和简单的算法，可以实现运行在O（n^2mlog（n^2/m））的时间。
英文摘要：
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time in the capacitated case (where n is the number of vertices and m is the number of edges of the underlying graph). We give a new and simple algorithm for the capacitated case which can be implemented to run in O(n^2m log(n^2/m)) time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
