Skip to main content
Book Chapter

Weighted Bipartite Matching

  • Kao M
Springer US, (2008), 1020-1020
DOI: 10.1007/978-0-387-30162-4_474
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

an edge e = ((, r) has weight w e ≥ 0 find a matching of maximum weight, where the weight of a matching is the sum of the weights of its edges Simplifying Assumptions (wlog [why?]): assume that |L| = |R| = n assume that there is an edge between every pair of nodes ((, r) ∈ V × V 19 Weighted Bipartite Matching © Harald Räcke 567

Cite

CITATION STYLE

APA

Kao, M.-Y. (2008). Weighted Bipartite Matching. In Encyclopedia of Algorithms (pp. 1020–1020). Springer US. https://doi.org/10.1007/978-0-387-30162-4_474

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free