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

Oshri Naparstek*, Amir Leshem

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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 {dot operator} 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 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 O(log(N)) processors and shared memory with an expected time complexity of O(Nlog(N)).

Original languageAmerican English
Pages (from-to)384-395
Number of pages12
JournalRandom Structures and Algorithms
Volume48
Issue number2
DOIs
StatePublished - 1 Mar 2016
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2014 Wiley Periodicals, Inc.

Keywords

  • Auction algorithm
  • Bipartite matching
  • Complexity
  • Pushrelabel algorithm
  • Random graphs

Fingerprint

Dive into the research topics of 'Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs'. Together they form a unique fingerprint.

Cite this