| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871987 | Discrete Applied Mathematics | 2016 | 12 Pages |
Abstract
In this paper we study elimination width from an algorithmic and graph searching perspective. We analyse variations of the elimination width game and show that this leads to width measures on which the directed dominating set problem and some variants of it become tractable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer,