The Minimum Label Spanning Tree Algorithm for the Graph of Bounded Treewidth
Xu Yichen · Computer Engineering and Science · 2008
This paper studies the minimal label spanning tree problem of graphs.First we introduce this problem on the general graphs.Then we focus on the minimal label spanning tree problem of the graphs of bounded treewidth.In this paper,we get an algorithm which is polynomial on the size of graph,showing that this problem is fixed-parameter tractable.