Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Zvi Galil, Silvio Micali, Harold N. Gabow. An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. SIAM Journal on Computing, 15(1):120-130, 1986.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General GraphsZvi Galil, Silvio Micali, Harold N. Gabow. focs 1982: 255-261 An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General GraphsSilvio Micali, Vijay V. Vazirani. focs 1980: 17-27 Efficient Algorithms for Finding Maximal Matching in GraphsZvi Galil. caap 1983: 90-113
The following publications are possibly variants of this publication: