Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference23 articles.
1. H. Alt, N. Blum, K. Mehlhorn, and M. Paul. Computing a maximum cardinality matching in a bipartite graph in timeO(n 1.5√m/logn).Inform. Process. Lett., 37:237–240, 1991.
2. R. K. Ahuja, A. V. Goldberg, J. B. Orlin, and R. E. Tarjan. Finding minimum-cost flows by double scaling.Math. Programming, 53:243–266, 1992.
3. R. K. Ahuja, R. L. Magnanti, and J. B. Orlin. Network flows.Handbook in Oper. Res. Management Sci., 1:211–360, 1991.
4. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for hamiltonian circuits and matching.J. Comput. Systems Sci., 18:155–193, 1979.
5. D. P. Bertsekas. A new algorithm for the assignment problem.Math. Programming, 21:152–171, 1981.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献