Login / Signup

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

Oshri NaparstekAmir Leshem
Published in: Random Struct. Algorithms (2016)
Keyphrases
  • dynamic programming
  • objective function
  • computational complexity
  • optimal solution
  • probabilistic model
  • shortest path problem
  • random graphs
  • search space
  • greedy heuristic
  • worst case
  • binary images
  • average case