Skip to main content

modules

Module title:Graphs, Networks and Algorithms
Module codeECM3906
Module lecturers:Dr Mark Callaway
Module credits:15

Graphs are a structure used to describe the underlying connectedness of a system and, therefore, have a vast range of applications from designing circuit boards to running a business efficiently. In this module, you will learn the theory of graphs and explore their practical application to solve a range of mathematical problems.

Real life problems typically involve enormous graphs, so a key theme in this module will be solving problems efficiently. In particular, some seemingly small and simple problems are so computationally complex that, even in this era of supercomputers, it would take longer than the lifetime of the universe to find a solution. Through analysing the effectiveness and computational complexity of algorithms, you will learn how to refine your proposed solution methods to optimise their performance.

Whilst there are no formal prerequisites, you should be familiar with material from the core undergraduate mathematics curriculum at Exeter, including the theory of sets and functions, analysis, linear algebra and mathematical proof.

Pre-requisites: ECM2902

Please note that all modules are subject to change, please get in touch if you have any questions about this module.