 2013 - 2014 | |||||||||||||||||||||||||||||||||||
 |
 |
||||||||||||||||||||||||||||||||||
| 0512-4409-01 | Network Algorithms | ||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| FACULTY OF ENGINEERING | |||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||
Course description
Credit Points: 3.5 points
Prerequisites: Algorithems - 0368.2160
Maximum flows and minimum cuts; Maximum flows in bipartite and planar graphs;
Network connectivity: global and local minimum cuts; Introduction to linear Programming; Minimum cost flows; Assignments and matchings; Multicommodity flows;Finding minimum cost reliable networks.