论文信息 - Maximum matching of given weight in complete and complete bipartite graphs - 字舞流文

Maximum matching of given weight in complete and complete bipartite graphs

[1] Shimon Even,et al. An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[2] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[3] O. Ore. Theory of Graphs , 1962 .

[4] Harold N. Gabow,et al. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.