Back to Results
First PageMeta Content



Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that
Add to Reading List

Document Date: 2016-03-20 15:51:33


Open Document

File Size: 106,48 KB

Share Result on Facebook
UPDATE