Expected time complexity of the auction algorithm and the push relabel algorithm for maximal bipartite matching on random graphs

Oshri Naparstek, Amir Leshem

In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of the auction algorithm for bipartite matching is $O\left(\frac{N\log^2(N)}{\log\left(Np\right)}\right)$ on sequential machines. This is equivalent to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with $O(\log(N))$ processors and shared memory with an expected time complexity of $O(N\log(N))$.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment