排序方式: 共有2条查询结果,搜索用时 18 毫秒
1
1.
2.
Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs
下载免费PDF全文
![点击此处可从《Random Structures and Algorithms》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We first prove that if for every non‐maximum matching on graph G there exist an augmenting path with a length of at most 2l + 1 then the auction algorithm converges after N ? l iterations at most. Then, we prove that the expected time complexity of the auction algorithm for bipartite matching on random graphs with edge probability and c > 1 is w.h.p. This time complexity is equal to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with processors and shared memory with an expected time complexity of . © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 48, 384–395, 2016 相似文献
1