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

Discrete math focuses on studying finite objects. It is an exciting area that has many connections to computer science, algebra, optimization, representation theory, and algebraic geometry. Our ...

Algorithms are central to modern mathematics and computer science. They are explicit procedures valued for their clarity, efficiency and beauty. Beyond these fields, however, the word “algorithm” is ...

When most people hear the word algorithm, their eyes glaze over. It feels technical, mechanical, even boring. Something hidden inside lines of code that only engineers care about. But that’s a narrow ...

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

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

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