Blar i Department of Informatics på emneord "Fixed-parameter tractability"
Viser treff 1-2 av 2
-
Computation of Treespan. A Generalization of Bandwidth to Treelike Structures
(Master thesis, 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 of ... -
Parameterized complexity of Eulerian deletion problems
(Peer reviewed; Journal article, 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 ...