KonigEgervaryThm

ClassS04CS141 | recent changes | Preferences

thm (Konig-Egervary): in any bipartite graph, size of maximum matching = size of minimum vertex cover.


ClassS04CS141 | recent changes | Preferences
This page is read-only | View other revisions
Last edited January 23, 2004 6:09 pm by NealYoung (diff)
Search: