Graph Algorithms
A diverse collection of optimization problems on networks can be phrased in the mathematical framework of graph theory. The Graph Algorithms group investigates how to exploit structural properties of graphs to develop provably efficient algorithms for hard combinatorial problems.
Exploiting graph structure to beat brute-force search
Algorithmic graph theory is a fascinating field of research. It challenges us to capture the properties of real-world networks in mathematical terms and exploit that structure to compute optimal solutions while avoiding brute-force search. This leads to beautiful mathematical problems, involving diverse approaches such as cops-and-robber games, crossing-free drawings of graphs, logic, and extremal structure theory. The solutions to these elegant problems have the potential to yield algorithms that are applicable in a wide variety of applications.
Read moreMeet some of our Researchers
Recent Publications
Our most recent peer reviewed publications
Contact
-
Visiting address
MetaForum, room MetaForum 7.071BGroene Loper 55612 AP EindhovenNetherlands -
Postal address
MetaForum 7.071B, PO Box 5135600 MB EindhovenNetherlands -
Teamlead