First Page | Document Content | |
---|---|---|
Date: 2016-03-20 15:51:33 | 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 thatAdd to Reading ListSource URL: www-tcs.cs.uni-sb.deDownload Document from Source WebsiteFile Size: 106,48 KBShare Document on Facebook |