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

Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...

When it comes to teaching math, a debate has persisted for decades: How, and to what degree, should algorithms be a focus of learning math? The step-by-step procedures are among the most debated ...