Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...

Depending on the underlying graph, you also need to handle cycles intelligently. In social networks, mutual relationships are ...

The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...

We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a ...

This course is available on the MSc in Applicable Mathematics and MSc in Management Science (Operational Research). This course is available as an outside option to students on other programmes where ...