Revision as of 00:59, 29 August 2022 edit Leopd (talk \| contribs) 105 edits →Matrix interpretation: Removing confusing tag as the key issue has been addressed in that the matrix interpretation has been clearly described. Also this explanation is vastly clearer than the bipartite graph version. Tags: Mobile edit Mobile web edit ← Previous edit		Revision as of 09:17, 29 September 2022 edit undo 136.36.225.23 (talk) →Bipartite graph formulation: which is "easier" is a matter of taste. Tags: Mobile edit Mobile web edit Next edit →
Line 48: === Bipartite graph formulation === The algorithm iscan ~~easier~~equivalently tobe ~~describe~~described ifby ~~we formulate~~formulating the problem using a bipartite graph. We have a [[complete bipartite graph]] <math>G=(S, T; E)</math> with {{mvar\|n}} worker vertices ({{mvar\|S}}) and {{mvar\|n}} job vertices ({{mvar\|T}}), and each edge has a nonnegative cost <math>c(i,j)</math>. We want to find a [[perfect matching]] with a minimum total cost. ==The algorithm in terms of bipartite graphs==

Hungarian algorithm: Difference between revisions