Browsing Department of Informatics by Subject "Graph minor"
Now showing items 1-1 of 1
(Springer, 2012-09)We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class ...Journal article