Title  A New Lowerbound for Treewidth 
Student  Vacancy 
Supervisor  Hans Bodlaender 
ECTS  7.5, possibly extendible to 15 
Related Course(s)  Algorithms and Networks 
Description  In a recent paper, a new graph parameter is defined, in terms of
a "graph search game". The authors also give a polynomial time algorithm to compute the parameter for given graphs, and show that the parameter is a lower bound for treewidth. In this project, this algorithm will be implemented and evaluated. Questions are:

Special Note 