摘要
本文给出了有向最优树的一个新的有效算法，证明了此算法的时间复杂度为Ｏ（ｎ４）。
In this paper, a new efficient algorithm for the optimal directed tree is presented.It is proved that the time complexity of this algorithm is O(n4). A numerical example is shown.
出处
《合肥工业大学学报（自然科学版）》
CAS
CSCD
1995年第S1期11-14,共4页
Journal of Hefei University of Technology：Natural Science
关键词
有向图
有向树
最优树
irected graph
direCted tree
optimal tree
