自适应性诊断的目的,是正确辨别出结点的性质。没有公共点的两对结点可以在同一个诊断周中出现。文中构造了星图的一个递归的哈密尔顿自适应诊断方法。在出错结点数不超过n-1个的情况下,这种方法只需要个诊断周。在最好和最坏的情况下,它分别需要n!+(n-2)和(2n-1)(n-1)!次诊断。
The goal of adaptive diagnosis is to correedy identify the properties of the processor. Two disjoint pairs of processors can be performed simultaneously in one round. In this paper, we construct a recursive Hamiltonian testing scheme on the star graph. With the number of faulty nodes not exceeding n - 1, this method only needs n parallel testing rounds. In the case of optimal and worst cases, it needs n ! + ( n - 2 ) tests and (2n - 1 ) ( n - 1 ) ! tests respectively.