a polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem：一个多项式算法来计算的最小程度生成树的有向非循环图的广播问题的应用.pdfVIP

Discrete Mathematics 308 (2008) 3951–3959 /locate/disc A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem a , 1 a b a Guohui Yao , Daming Zhu , Hengwu Li , Shaohan Ma a School of Computer Science and Technology, Shandong University, Jinan 250061, PR China bDepartment of Computer Science and Technology, Shandong Economic University, Jinan 250014, PR China Received 15 March 2007; received in revised form 18 July 2007; accepted 23 July 2007 Available online 12 September 2007 Abstract In this paper, we focus on the directed minimum degree spanning tree problem and the minimum time broadcast problem. Firstly, we propose a polynomial time algorithm for the minimum degree spanning tree problem in directed acyclic graphs. The algorithm starts with an arbitrary spanning tree, and iteratively reduces the number of vertices of maximum degree. We can prove that the algorithm must reduce a vertex of the maximum degree for each phase, and finally result in an optimal tree. The algorithm terminates in O(mn log n) time, where m and n are the numbers of edges and vertices of the graph, respectively. Moreover, we apply the new algorithm to the minimum time broadcast problem. Two consequences for directed acyclic graphs are: (1) the problem under the vertex-disjoint paths mode can be approximated within a factor of O(log n/ log OPT) of the optimum in O(mn log n)- time;