Category Archives: Graph Theory
Netsweeper: playing Minesweeper without the old-fashioned grid
Cycling to 57,912 National Monuments in the Netherlands
In March 2021 the largest roadmap instance of the traveling salesman problem ever was solved.
A big breakthrough in the Euclidean Travelling Salesman Problem
Recently there has been a breakthrough in the field of algorithms for geometric network problems, concerning the complexity of the…
Stumbling around in a changing world
Random walks are popularly described as a drunkard’s path down the streets. What happens when the streets also start to…
Complex networks
Modelling real-world networks!Have you ever wondered what mathematicians mean when they talk about mathematical models of real-life phenomena? And what can…
Degrees in graphs IV: degrees in large real-world networks
How are elements in real-world networks connected? That is the question we aim to answer in this post. Most real-world…
Finding the shortest route to your holiday destination: Dijkstra's algorithm
Twenty years ago, driving to your holiday destination was a tedious task. You had to plot a route in a…
Degrees in graphs III: Which degrees sequences are possible?
In previous article, we discussed what the degree sequence of a network or graph is. Recall that a graphical sequence…
Network analysis of tax treaties
Large international companies often do not send their profits directly from one country to another. Instead, they send it via…