This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Edmonds, J.: Paths, Trees, and Flowers. Canad. J. Math. 17 (1965), pp. 449–467.
Galil, Z., Micali, S., Gabow, H.: Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Mathching in General Graphs. Proc. 23rd Annual Symposium on Foundations of Computer Science, (1982), pp. 255–261.
Hopcroft, J. E., Karp, R. M.: An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. on Comput. 2 (1973), pp. 225–231.
Mendelson, N. S., Dulmage, A. L.: Some generalizations of the problem of distinct representatives. Canad. J. Math. 10 (1958) pp.230–241.
Micali, S., Vazirani, V. V.: An O(√|V||E|) Algorithm for Finding Maximum Matchings in General Graphs. Proc. 21st Annual Symposium on Foundations of Computer Science, (1981), pp. 17–27.
Tarjan, R. E.: Efficiency of a Good But Not Linear Set Union Algorithm. JACM 22 (1975), p. 215–225.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spencer, T.H., Mayr, E.W. (1984). Node weighted matching. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_42
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive