81 citations · 403 across the 47 of their papers we have counts for
1 paper · 2 filters
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…