| MAT2402 Networks | | | |
| Code | MAT2402 |
| Title | Networks | | Credits | 2 | | Lecuter(s) | | | Syllabus | - Basic graph theoretical concepts;
- Shortest paths and minimum spanning tree;
- Flow in networks, max-flow-min-cut theorem;
- Matching in bipartite graphs;
- Critical Path and PERT techniques;
- Scheduling and sequencing problems;
- Travelling salesman problem. | | Reading | - Dolan A., Aldous J., Networks and Algorithms, An Introductory Approach, John Wiley & Sons, 1994.
- Biggs N.L., Discrete Mathematics, Oxford Science Publications, Clarendon Press, Oxford, 1989.
- Gibbons A., Algorithmic Graph Theory, Cambridge University Press, 1985.
- Wilson R.J., Introduction to Graph Theory, Longman, 4th Edition, 1996. | | Assessment | Module Result: 100% |
| | | |
|
