Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
The Discrete Milling problem is a natural and quite general graph-theoretic model for geometric milling problems: Given a graph, one asks for a walk that covers all its vertices with a minimum number of turns, as specified in the graph model by a 0/1 turncost function f x at each vertex x giving, for each ordered pair of edges (e,f) incident at x, the turn cost at x of a walk that enters the vertex on edge e and departs on edge f. We describe an initial study of the parameterized complexity of the problem.
KeywordsGrid Graph Directed Walk Free Pair Monochromatic Path Decomposable Graph
Unable to display preview. Download preview PDF.
- 8.Szeider, S.: Not so easy problems for tree decomposable graphs. In: International Conference on Discrete Mathematics (ICDM), pp. 161–171 (2008) (invited talk)Google Scholar