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

Harold N. Gabow, Robert Endre Tarjan. Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 2-4 May 1988, Chicago, Illinois, USA. pages 514-527, ACM, 1988.

Abstract

Abstract is missing.