论文部分内容阅读
寻找症候的最小相容集,这是系统级故障诊断的一个重要问题,在ChwaHakimi模型下,我们证明了两个结果:1)对于二分图系统,该问题是NP难的;2)对于森林系统,该问题是多项式时间可解的。
Finding the least compatible set of symptoms is an important issue for system-level fault diagnosis. Under the Chwa-Hakimi model, we prove two results: 1) the problem is NP-hard for bipartite graph systems; 2) Forest system, the problem is polynomial time solvable.