9 citations · 14 across the 11 of their papers we have counts for
1 paper · 1 filter
Dušan Knop, Pavel Dvořák
We show that the Minimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task…