Finding a complete matching with the maximum product on weighted bipartite graphs
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..
[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[3] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[4] P. Hall. On Representatives of Subsets , 1935 .
[5] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[6] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[7] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[8] Ronald J. Gould,et al. Graph theory , 1988 .
[9] L. R. Foulds. Optimization Techniques: An Introduction , 1981 .