Browsing Department of Informatics by Subject "Fixed-parameter tractability"
Now showing items 1-2 of 2
(The University of Bergen, 2012-06-14)Motivated by a search game, Fomin, Heggernes and Telle [Algorithmica, 2005] defined the graph parameter treespan, a generalization of the well studied parameter bandwidth. Treespan is the maximum number of appearances ...Master thesis
(Springer, 2014-01)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ...Journal article