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 ...

Variational methods on graphs extend the classical calculus of variations to discrete structures, treating vertices and edges as the domain for differential‐like operators. By associating an energy ...

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 ...

Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...

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 ...