Maximum-Weight Matching: Revision history

28 April 2023

• curprev 09:0809:08, 28 April 2023‎ Admin talk contribs‎ 1,590 bytes −175‎ No edit summary

10 April 2023

• curprev 07:5207:52, 10 April 2023‎ Admin talk contribs‎ 1,765 bytes +8‎ No edit summary

15 February 2023

• curprev 14:4414:44, 15 February 2023‎ Admin talk contribs‎ 1,757 bytes −13‎ No edit summary
• curprev 14:3614:36, 15 February 2023‎ Admin talk contribs‎ 1,770 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 1,772 bytes +269‎ No edit summary
• curprev 12:0212:02, 15 February 2023‎ Admin talk contribs‎ 1,503 bytes −9‎ No edit summary

• curprev 10:2110:21, 15 February 2023‎ Admin talk contribs‎ 1,512 bytes +1,512‎ Created page with "{{DISPLAYTITLE:Maximum-Weight Matching (Maximum-Weight Matching)}} == Description == In computer science, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. Here, the graph is unrestricted; i.e. can be any general graph. == Related Problems == Subproblem: Bipartite Maximum-Weight Matching == Parameters == <pre>n: number of vertices m: number of edges N: largest weight magnit..."