Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Knot Diagrams of Treewidth Two
Hans L. Bodlaender, Benjamin Burton, Fedor V. Fomin +1
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth…
cs.DS2018
Dispersing obnoxious facilities on a graph
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl +1
We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal i…