Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference17 articles.
1. Alt, H., Blum, N., Mehlhorn, K., Paul, M.: Computing a maximum cardinality matching in a bipartite graph in timeO(n 1.5√m/logn). Inf. Proc. Lett.37, 237–240 (1991).
2. Bollobás, B., Thomason, A.: Random graphs of small order. Random Graphs, ’83. Ann. Disc. Math.28, 47–97 (1985).
3. Burkard, R. E., Derigs, U.: Assignment and matching problems: solution methods with Fortran-programs. Springer Lecture Notes Econ. Math. Sys.184 (1980).
4. Carpaneto, G., Toth, P.: Algorithm for the solution of the bottleneck assignment problem. Computing27, 179–187 (1981).
5. Carpaneto, G., Toth, P.: Algorithm for the solution of the assignment problem for sparse matrices. Computing31, 83–94 (1983).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献