Parameterized Complexity of the Spanning Tree Congestion Problem (2011)
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s00453-011-9565-7
Publication URI: http://dx.doi.org/10.1007/s00453-011-9565-7
Type: Journal Article/Review
Parent Publication: Algorithmica
Issue: 1