Example: bankruptcy
CMSC 451: Maximum Bipartite Matching

CMSC 451: Maximum Bipartite Matching

Back to document page

Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Based on Section 7.5 of Algorithm Design by Kleinberg & Tardos. Network Flows s u v t x w 20 10 30 20 5 30 10 20 10 10 5 15 15 5 10 The network ow problem is itself interesting. But even more interesting is how you can use it to solve many

  Carl

Download CMSC 451: Maximum Bipartite Matching


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries