The Notion of Similarity in Data and Pattern Spaces
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[2] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[3] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[4] Harold N. Gabow. Scaling Algorithms for Network Problems , 1985, J. Comput. Syst. Sci..
[5] Robert E. Tarjan,et al. Almost-optimum speed-ups of algorithms for bipartite matching and related problems , 1988, STOC '88.
[6] L FredmanMichael,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .
[7] Andrew V. Goldberg,et al. Sublinear-Time Parallel Algorithms for Matching and Related Problems , 1993, J. Algorithms.
[8] Harold N Gabow. Scaling Algorithms for Network Problems ; CU-CS-266-84 , 1984 .
[9] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.