MTM3671 · Graph Theory and Algorithms

5. Semester · Elective · 3+0+0 · 5 ECTS

About the Course

History of Graph Theory, Usage Areas of Graph Theory, Paths, Trees and Cycles, Shortest Path Problem, Connectivity, Eulerian Tours, Hamiltonian Cycles, Networks, Minimum and Maximum Network Flow Problems, Graph Decomposition, Combinatorial Applications.

Resources

Graph Theory: Modeling, Applications and Algorithms, G. Agnarsson, R. Greenlaw, Pearson, 2006.
Network Flows, R. K. Ahuja, T.L. Magnanti, J. B. Orlin, Pearson, 1993.
Network Science, A. L. Barabasi, Cambridge University Press, 2016.
Graphs, Algorithms and Optimization, W.L. Kocay, D.L. Kreher, CRC Press, 2017.
Graphs and Digraphs, G. Chratrand, L. Lesniak, P. Zhang, CRC Press, 2011.
Graphs, Networks amd Algorithms, D. Jungnickel, Springer Verlag, 2005.

Assessment System

In-term

60%

Mid-Terms2 items60%

Final

40%

End-of-term exam