This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

The course provides an introduction to selected topics in discrete mathematics; graph theory, combinatorics, final bodies and code theory. you know basic definitions ...

This title is part of a longer publication history. The full run of this journal will be searched. TITLE HISTORY A title history is the publication history of a journal and includes a listing of the ...

We are developing essential resources for students to use mathematical software effectively. Our goal is to streamline the learning process with Sage. This approach helps students focus more on ...

Graph curvature and Laplacian operators form a vibrant area of research at the intersection of differential geometry and graph theory. The concept of graph curvature, inspired by classical Ricci ...

This repository contains the official code for our MICCAI 2025 paper, “Semantically Consistent Discrete Diffusion for 3D Biological Graph Generation.” We introduce a discrete diffusion framework that ...

Abstract: A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by ...

Abstract: We present a hybrid approach combining Reinforcement Learning (RL) with the TabuCol, which is a version of tabu search specifically designed for the Graph Coloring Problem (GCP), enhanced by ...