Login / Signup

Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems

Harold N. GabowRobert Endre Tarjan
Published in: STOC (1988)
Keyphrases
  • related problems
  • bipartite matching
  • learning algorithm
  • computational complexity
  • worst case
  • test problems
  • broadly applicable
  • data structure
  • special case