Graph Theory
Module ID
Ε605
Semester
6
Hours/Week - ECTS
4 – 5
Petros Lampsas
Professor
Learning Outcomes
Understanding of Graph Theory and its applications in modeling and algorithmically solving practical network problems.
Indicative Module Content
- Definitions, Graph types, Graph Isomorphism
- Data structures for graph manipulation
- Trees, Spanning Trees, Minimum Spanning Trees (Prim and Kruskal Algorithms), Tree Traversal
- Connected Graphs, Eulerian and Hamiltonian Paths
- Shortest Path Algorithms and Routing in Data Networks
- Flows, Max Flow-Min Cut theorem