Jump to content

Edmonds matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Arrive (talk | contribs) at 16:02, 25 May 2007 (Created page with 'For a bipartite graph <math>G(U, V, E)</math> with sets of vertices <math>U = \{u_1, u_2, ..., u_n \}</math> and <math>V = \{v_1, v_2, ..., v_n\}</math>. Then the E...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

For a bipartite graph with sets of vertices and . Then the Edmonds Matrix is defined as