Graph matching encompasses a class of computational problems aimed at identifying a correspondence between the vertex sets of two graphs so as to maximise structural similarity or alignment. Exact ...

Random graph theory provides a probabilistic framework for modelling and analysing networks in which connections between entities are assigned according to specified random processes. From its origins ...

Discrete structures are omnipresent in mathematics, computer science, statistical physics, optimisation and models of natural phenomena. For instance, complex random graphs serve as a model for social ...

This course is available on the MSc in Mathematics and Computation. This course is available with permission as an outside option to students on other programmes where regulations permit. This course ...