摘要
为了迅速准确地测试网络拓扑结构中任意两结点问的通路故障，本文提出了通路树和最小覆盖树生长回归算法。运用该算法可以自动产生出最优覆盖集，从而为网络管理者诊断网络的通路故障提供了可靠依据。
in order to find out the path fault between two arbitrary nodes in topological network structure,this paper presents the path-tree and the minimal cover subtree growth-regression ajgorithm.which can be applied to span automatically the optimum cover set.thus provides for the network administrater the basis of diagnosesing path faults of the network.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1994年第11期12-15,共4页
Journal of Computer Research and Development
