| Display title | Maximum weight matching |
| Default sort key | Maximum weight matching |
| Page length (in bytes) | 1,947 |
| Namespace ID | 0 |
| Page ID | 233660 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Jworkorg (talk | contribs) |
| Date of page creation | 18:55, 8 February 2024 |
| Latest editor | Jworkorg (talk | contribs) |
| Date of latest edit | 18:55, 8 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science and graph theory, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized.
A special case of it is the assignment problem, in which the input is restricted to be a bipartite graph, and the matching constrained... |
