Search Results - VDP::Algorithms and computability theory: 422~

Parameterized Complexity of the Spanning Tree Congestion Problem by Bodlaender, Hans L., Fomin, Fedor V., Golovach, Petr A., Otachi, Yota, van Leeuwen, Erik Jan

“…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…”
Get full text