lecture17: Advanced tree-like network design

This lecture continues the discussion of treelike networks, in particular presenting algorithms for solving more complex tree-like network designs (Gomory-Hu and Gusfield's methods), using cut-sets.

Topics covered

• Tree-like networks
• Costs
• Methods of attack
• Cutsets
• Cutset example
• Fundamental Cutset
• Non-crossing cutsets
• Crossing cutsets examples
• Non-crossing cutsets examples
• Non-crossing cutsets and trees
• Cutsets and trees example
• Min-hop tree
• Gomory-Hu Method
• Lemma proof
• Lemma proof (continued)
• Gomory-Hu Algorithm
• Gomory-Hu Example
• Gomory-Hu Example: summary
• Gomory-Hu Complexity
• Gusfield's Algorithm
• Gusfield's Algorithm Example