论文信息 - Node Weighted Matching - 字舞流文

Node Weighted Matching

Ernst W. Mayr | Thomas H. Spencer

[1] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[2] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[3] S. Micali,et al. Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

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

[5] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[6] N. S. Mendelsohn,et al. Some generalizations of the problem of distinct representatives , 1958 .